Observations Concerning Chordal Graph Polynomials

Allen D. Parks
2015 Zenodo  
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
more » ... are clique equivalent to connected chordal graphs with clique numbers less than four is identified.Read Complete Article at ijSciences: V3201412574
doi:10.5281/zenodo.3348831 fatcat:thhmne2gejhibjrbwmgjzalmvy