On the largest real root of independence polynomials of trees.

MaRDI QIDQ4568161zbMATH OpenFDO

Authors Mohammad Reza Oboudi

Publication date 15 June 2018

zbMATH Keywords

treepartial orderindependence polynomialindependent setlargest real root

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Maximum modulus of independence roots of graphs and trees
• On trees with real-rooted independence polynomial
• Bounding the roots of independence polynomials.
• Note on the smallest root of the independence polynomial
• Independent sets in trees

Cited in

(12)

• scientific article; zbMATH DE number 32144 (Why is no real title available?)
• Independence polynomials of \(k\)-tree related graphs
• The average domination polynomial of graphs is unimodal
• Maximum modulus of independence roots of graphs and trees
• On trees with real-rooted independence polynomial
• Majorization and the spectral radius of starlike trees
• Bounding the roots of independence polynomials.
• Some results on the independence polynomial of unicyclic graphs
• On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs
• On real-rootedness of independence polynomials of rooted products of graphs
• Note on the smallest root of the independence polynomial
• Forests whose independence polynomials are palindromic and have only real roots

This page was built for publication: On the largest real root of independence polynomials of trees.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568161)