On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs

DOI10.1016/j.disc.2003.06.010zbMath1042.05047MaRDI QIDQ1827719

Hai-xing Zhao, Sheng Gui Zhang, Ru-Ying Liu, Xue Liang Li

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.06.010

zbMATH Keywords

Chromatically unique; \(\sigma\)-Polynomials; Adjoint polynomials; Adjointly unique; Minimum real roots

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS, Two remarks on the adjoint polynomial, On problems and conjectures on adjointly equivalent graphs, The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\), On the minimum real roots of the adjoint polynomial of a graph, About chromatic uniqueness of some complete tripartite graphs, One more remark on the adjoint polynomial, On the Roots of σ-Polynomials

Cites Work

• The search for chromatically unique graphs
• Chromaticity of the complements of paths and cycles
• A new method for proving chromatic uniqueness of graphs
• The search for chromatically unique graphs. II
• Adjoint polynomials and chromatically unique graphs
• Chromaticity of some families of dense graphs
• \(\sigma\)-polynomials and graph coloring
• Expansions of Chromatic Polynomials and Log-Concavity
• On chromatic equivalence of graphs
• Location of Zeros of Chromatic and Related Polynomials of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item