Relations and bounds for the zeros of graph polynomials using vertex orbits

Abstract In this paper, we prove bounds for the unique, positive zero of O G ★ ( z ) : = 1 − O G ( z ) , where OG(z) is the so-called orbit polynomial [1]. The orbit polynomial is based on the multiplicity and cardinalities of the vertex orbits of a graph. In [1] , we have shown that the unique, positive zero δ ≤ 1 of O G ★ ( z ) can serve as a meaningful measure of graph symmetry. In this paper, we study special graph classes with a specified number of orbits and obtain bounds on the value of δ.

[1]  Nenad Trinajstić,et al.  On the distance polynomial of a graph , 1983 .

[2]  Charles J. Colbourn,et al.  Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs , 1981, SIAM J. Comput..

[3]  Adalbert Kerber,et al.  Molecules in Silico: A Graph Description of Chemical Reactions , 2007, J. Chem. Inf. Model..

[4]  Morton E. Munk,et al.  Graph automorphism perception algorithms in computer-enhanced structure elucidation , 1993, J. Chem. Inf. Comput. Sci..

[5]  Subhash C. Basak,et al.  Topological Indices: Their Nature and Mutual Relatedness , 2000, J. Chem. Inf. Comput. Sci..

[6]  Kurt Varmuza,et al.  Substructure Isomorphism Matrix , 2000, J. Chem. Inf. Comput. Sci..

[7]  Criel Merino,et al.  Graph Polynomials and Their Applications I: The Tutte Polynomial , 2008, Structural Analysis of Complex Networks.

[8]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[9]  Yeong-Nan Yeh,et al.  The Wiener polynomial of a graph , 1996 .

[10]  Yongtang Shi,et al.  Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix , 2015, Appl. Math. Comput..

[11]  W. T. Tutte,et al.  Graph-polynomials , 2004, Adv. Appl. Math..

[12]  Roberto Todeschini,et al.  Handbook of Molecular Descriptors , 2002 .

[13]  Elena V. Konstantinova,et al.  The Discrimination Ability of Some Topological and Information Distance Indices for Graphs of Unbranched Hexagonal Systems , 1996, J. Chem. Inf. Comput. Sci..

[14]  Matthias Dehmer,et al.  A Note on Graphs with Prescribed Orbit Structure , 2019, Entropy.

[15]  Yongtang Shi,et al.  Toward Measuring Network Aesthetics Based on Symmetry , 2017, Axioms.

[16]  A. Mowshowitz,et al.  Entropy and the complexity of graphs. I. An index of the relative complexity of a graph. , 1968, The Bulletin of mathematical biophysics.

[17]  M. Marden.  Geometry of Polynomials , 1970 .

[18]  N. Trinajstic.  Chemical Graph Theory , 1992 .

[19]  A. Mowshowitz.  Entropy and the complexity of graphs. II. The information content of digraphs and infinite graphs. , 1968, The Bulletin of mathematical biophysics.

[20]  Jin Tao,et al.  The Orbit-Polynomial: A Novel Measure of Symmetry in Networks , 2020, IEEE Access.

[21]  J. Gasteiger,et al.  Chemoinformatics: A Textbook , 2003 .

[22]  M. Mignotte,et al.  Polynomials: An Algorithmic Approach , 1999 .

[23]  D. Bonchev,et al.  Complexity in chemistry, biology, and ecology , 2005 .

[24]  Bill Jackson,et al.  Zeros of chromatic and flow polynomials of graphs , 2002, math/0205047.

[25]  Kurt Varmuza,et al.  Binary Substructure Descriptors for Organic Compounds , 2005 .

[26]  Danail Bonchev,et al.  Information theoretic indices for characterization of chemical structures , 1983 .