Abstract
It is well known that the coefficients of the matching polynomial are unimodal. Unimodality of the coefficients (or their absolute values) of other graph polynomials has been studied as well. One way to prove unimodality is to prove real-rootedness.Recently I. Beaton and J. Brown (2020) proved the for almost all graphs the coefficients of the domination polynomial form a unimodal sequence, and C. Barton, J. Brown and D. Pike (2020) proved that the forest polynomial (aka acyclic polynomial) is real-rooted iff G is a forest.Let A be a graph property, and let ai(G) be the number of induced subgraphs of order i of a graph G which are in A. Inspired by their results we prove:Theorem: If A is the complement of a hereditary property, then for almost all graphs in G(n,p) the sequence ai(G) is unimodal.Theorem: If A is a hereditary property which contains a graph which is not a clique or the complement of a clique, then the graph polynomial PA(G;x)=∑iai(G)xi is real-rooted iff G∈A.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
