Distinctive power and comparability of Harary polynomial
Johann A. Makowsky

TL;DR
This paper investigates the properties and distinctions of Harary polynomials, which generalize chromatic polynomials based on graph colorings constrained by a property, focusing on their definability, invariance, and the concept of graph 'mates' with similar polynomial characteristics.
Contribution
It analyzes conditions under which Harary polynomials are definable, invariant, and how they compare in distinctiveness, extending previous work on their logical and algebraic properties.
Findings
Conditions for Harary polynomial definability in Monadic Second Order Logic
Criteria for invariance of Harary polynomials as chromatic invariants
Relationships between different Harary polynomials in terms of distinctiveness
Abstract
Let be a graph property. A -coloring with at most colors is a coloring of the vertices of a simple graph such that each color class induces a graph in . Harary polynomials are generalizations of the chromatic polynomial for simple graphs based on conditional colorings. We denote by the number of -colorings of with at most colors. is a polynomial in . A first paper studying Harary polynomials systematically was published in 2021 by O.Herscovici, J.A. Makowsky and V. Rakita. It studies under which conditions on is definable in Monadic Second Order Logic and under which conditions is a chromatic invariant. Let be two graph properties. Two graphs are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Topology and Set Theory · Advanced Combinatorial Mathematics
