Abstract
The orbit polynomial is a new graph counting polynomial which is defined as OG(x)=∑i=1rx|Oi|, where O1, …, Or are all vertex orbits of the graph G. In this article, we investigate the structural properties of the automorphism group of a graph by using several novel counting polynomials. Besides, we explore the orbit polynomial of a graph operation. Indeed, we compare the degeneracy of the orbit polynomial with a new graph polynomial based on both eigenvalues of a graph and the size of orbits.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference37 articles.
1. Spectra of Graphs Theory and Applications;Cvetković,1995
2. On some counting polynomials in chemistry
3. Generalizations of the matching polynomial;Gutman;Util. Math.,1983
4. Polynomials in Graph Theory. Chemical Graph Theory, Introduction and Fundamentals;Gutman,1991
5. Randić index and information
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献