Abstract | ||
---|---|---|
The orbit polynomial is a new graph counting polynomial which is defined as O-G(x) = Sigma(r)(i=1)x(vertical bar Oi vertical bar), where O-1, ... , O-r 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. |
Year | DOI | Venue |
---|---|---|
2020 | 10.3390/sym12101643 | SYMMETRY-BASEL |
Keywords | DocType | Volume |
automorphism group,orbit,group action,polynomial roots,orbit-stabilizer theorem | Journal | 12 |
Issue | Citations | PageRank |
10 | 0 | 0.34 |
References | Authors | |
0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Modjtaba Ghorbani | 1 | 8 | 8.93 |
Matthias Dehmer | 2 | 863 | 104.05 |
Frank Emmert-streib | 3 | 506 | 67.78 |