Log-concavity of genus distributions of ring-like families of graphs

Abstract We calculate genus distribution formulas for several families of ring-like graphs and prove that they are log-concave. The graphs in each of our ring-like families are obtained by applying the self-bar-amalgamation operation to the graphs in a linear family (linear in the sense of Stahl). That is, we join the two root-vertices of each graph in the linear family. Although log-concavity has been proved for many linear families of graphs, the only other ring-like sequence of graphs of rising maximum genus known to have log-concave genus distributions is the recently reinvestigated sequence of Ringel ladders. These new log-concavity results are further experimental evidence in support of the long-standing conjecture that the genus distribution of every graph is log-concave. Further evidence in support of the general conjecture is the proof herein that each partial genus distribution, relative to face-boundary walk incidence on root vertices, of an iterative bar-amalgamations of copies of various given graphs is log-concave, which is an unprecedented result for partitioned genus distributions. Our results are achieved via introduction of the concept of a vectorized production matrix, which seems likely to prove a highly useful operator in the theory of genus distributions and via a new general result on log-concavity.

[1]  W. T. Tutte A Census of Planar Maps , 1963, Canadian Journal of Mathematics.

[2]  Jonathan L. Gross,et al.  Genus distributions for bouquets of circles , 1989, J. Comb. Theory, Ser. B.

[3]  Yi Wang,et al.  A unified approach to polynomial sequences with only real zeros , 2005, Adv. Appl. Math..

[4]  J.W.T. Youngs Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9 , 1970 .

[5]  Jonathan L. Gross,et al.  Embeddings of graphs of fixed treewidth and bounded degree , 2013, Ars Math. Contemp..

[6]  Jonathan L. Gross,et al.  On the average genus of a graph , 1993, Graphs Comb..

[7]  G. Ringel,et al.  Solution of the heawood map-coloring problem. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Anita Patil-Deshmukh,et al.  Maps , 1992 .

[9]  T. Pisanski,et al.  Graphs on Surfaces , 2013 .

[10]  G. Jones,et al.  Theory of Maps on Orientable Surfaces , 1978 .

[11]  L. Beineke,et al.  Topics in Topological Graph Theory , 2009 .

[12]  Jonathan L. Gross,et al.  Genus Distribution of Graph Amalgamations: Pasting at Root-Vertices , 2010, Ars Comb..

[13]  Saul Stahl,et al.  Permutation-partition pairs. III. Embedding distributions of linear families of graphs , 1991, J. Comb. Theory, Ser. B.

[14]  Yichao Chen A Note on a Conjecture of S. Stahl , 2008, Canadian Journal of Mathematics.

[15]  Jonathan L. Gross,et al.  Hierarchy for imbedding-distribution invariants of a graph , 1987, J. Graph Theory.

[16]  Jonathan L. Gross,et al.  Log-Concavity of Combinations of Sequences and Applications to Genus Distributions , 2014, SIAM J. Discret. Math..

[17]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[18]  Yanpei Liu,et al.  On a Conjecture of S. Stahl , 2010, Canadian Journal of Mathematics.

[19]  Jonathan L. Gross,et al.  Log-concavity of the genus polynomials of Ringel Ladders , 2015, Electron. J. Graph Theory Appl..

[20]  Jianer Chen Minimum Genus and Maximum Genus , 2013 .

[21]  Jonathan L. Gross,et al.  Genus distribution of graph amalgamations: self-pasting at root-vertices , 2011, Australas. J Comb..

[22]  Saul Stahl ON THE ZEROS OF SOME GENUS POLYNOMIALS , 1997 .

[23]  Richard Statman,et al.  Genus distributions for two classes of graphs , 1989, J. Comb. Theory, Ser. B.