We prove that the genus polynomials of the graphs called iterated claws are real-rooted. This continues our work directed toward the 25-year-old conjecture that the genus distribution of every graph is log-concave. We have previously established log-concavity for sequences of graphs constructed by iterative vertex-amalgamation or iterative edgeamalgamation of graphs that satisfy a commonly observable condition on their partitioned genus distributions, even though it had been proved previously that iterative amalgamation does not always preserve real-rootedness of the genus polynomial of the iterated graph. In this paper, the iterated topological operation is adding a claw, rather than vertex- or edge-amalgamation. Our analysis here illustrates some advantages of employing a matrix representation of the transposition of a set of productions.
CITATION STYLE
Gross, J. L., Mansour, T., Tucker, T. W., & Wang, D. G. L. (2016). Iterated claws have real-rooted genus polynomials. In Ars Mathematica Contemporanea (Vol. 10, pp. 255–268). Society of Mathematicians, Physicists and Astronomers of Slovenia. https://doi.org/10.26493/1855-3974.538.86e
Mendeley helps you to discover research relevant for your work.