Algebraic integers as chromatic and domination roots

DOI10.1155/2012/780765zbMath1258.05053OpenAlexW2048753399WikidataQ58703367 ScholiaQ58703367MaRDI QIDQ446327

Saeid Alikhani, Roslan Hasni

Publication date: 6 September 2012

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/780765

zbMATH Keywords

zerosalgebraic integerschromatic polynomialdomination polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Graphs whose certain polynomials have few distinct roots ⋮ On the roots of domination polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The domination polynomial of a graph at \(-1\)
• Characterization of graphs using domination polynomials
• Dominating sets and domination polynomials of paths
• On the corona of two graphs
• An atlas of domination polynomials of graphs of order at most six
• Dominatind sets and domination polynomials of certain graphs. II
• Chromatic zeros and the golden ratio
• Chromatic zeros and generalized Fibonacci numbers
• A Zero-Free Interval for Chromatic Polynomials of Graphs
• Chromatic Roots are Dense in the Whole Complex Plane
• Introduction to Domination Polynomial of a Graph
• On chromatic polynomials and the golden ratio
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.

This page was built for publication: Algebraic integers as chromatic and domination roots