Orbit Polynomial of Graphs Versus Polynomial with Integer Coefficients

Orbit Polynomial of Graphs Versus Polynomial with Integer Coefficients

Suppose <i>a<sub>i</sub></i> indicates the number of orbits of size <i>i</i> in graph <i>G</i>. A new counting polynomial, namely an orbit polynomial, is defined as <i>O<sub>G</sub></i>(<i>x</i>) = ∑<i><sub&...

Full description

Bibliographic Details
Main Authors: Modjtaba Ghorbani, Maryam Jalali-Rad, Matthias Dehmer
Format: Article
Language:English
Published: MDPI AG 2021-04-01
Series:Symmetry
Subjects:
orbit
group action
polynomial roots
orbit-stabilizer theorem
Online Access:https://www.mdpi.com/2073-8994/13/4/710

Internet

https://www.mdpi.com/2073-8994/13/4/710

Similar Items