Observations Concerning Chordal Graph Polynomials

Allen D. Parks

International Journal of Sciences, 2015, vol. 4, issue 01, 36-39

Abstract: For every graph that is clique equivalent to a connected chordal graph, it is shown that the associated dependence polynomial has a unit root and that the associated clique and independence polynomials have negative unit roots. The dependence polynomial for a graph that is the join of two graphs is also shown to have a unit root when at least one of the two joined graphs is clique equivalent to a connected chordal graph. A condition satisfied by the eigenvalues of graphs that are clique equivalent to connected chordal graphs with clique numbers less than four is identified.

Keywords: chordal graph; graph polynomial; dependence polynomial; clique polynomial; independence polynomial; graph eigenvalues (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.ijsciences.com/pub/article/574 (text/html)
https://www.ijsciences.com/pub/pdf/V420150111.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:adm:journl:v:4:y:2015:i:1:p:36-39

Ordering information: This journal article can be ordered from
https://www.ijsciences.com/payment_guide.php

Access Statistics for this article

More articles in International Journal of Sciences from Office ijSciences Alkhaer Publications Manchester M8 8XG England.
Bibliographic data for series maintained by Staff ijSciences ().