Abstract
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.
| Original language | American English |
|---|---|
| Pages (from-to) | 255-268 |
| Number of pages | 14 |
| Journal | Ars Mathematica Contemporanea |
| Volume | 10 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2016 |
Keywords
- Graph genus polynomials
- Log-concavity
- Real-rootedness
- Topological graph theory
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Algebra and Number Theory
- Geometry and Topology
- Discrete Mathematics and Combinatorics