Relations and bounds for the zeros of graph polynomials using vertex orbits
Research output: Contribution to journal › Article › Scientific › peer-review
|Journal||Applied Mathematics and Computation|
|Publication status||Published - 1 Sep 2020|
|Publication type||A1 Journal article-refereed|
In this paper, we prove bounds for the unique, positive zero of OG ★(z):=1−OG(z), where OG(z) is the so-called orbit polynomial . The orbit polynomial is based on the multiplicity and cardinalities of the vertex orbits of a graph. In , we have shown that the unique, positive zero δ ≤ 1 of OG ★(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 δ.