Relations and bounds for the zeros of graph polynomials using vertex orbits
In this paper, we prove bounds for the unique, positive zero of O  G (z) := 1 −O G (z) , where O G ( z ) is the so-called orbit polynomial [1]. The orbit polynomial is based on the multiplic- ity 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 δ.
Authors:
; ; ; ; ; ; ; ; ;
Award ID(s):
Publication Date:
NSF-PAR ID:
10165211
Journal Name:
Applied mathematics and computation
ISSN:
0096-3003
1. Research on the structural complexity of networks has produced many useful results in graph theory and applied disciplines such as engineering and data analysis. This paper is intended as a further contribution to this area of research. Here we focus on measures designed to compare graphs with respect to symmetry. We do this by means of a novel characteristic of a graph G, namely an orbit polynomial.'' A typical term of this univariate polynomial is of the form czn, where c is the number of orbits of size n of the automorphism group of G. Subtracting the orbit polynomial frommore »
4. Abstract May the triforce be the 3-uniform hypergraph on six vertices with edges {123′, 12′3, 1′23}. We show that the minimum triforce density in a 3-uniform hypergraph of edge density δ is δ 4– o (1) but not O ( δ 4 ). Let M ( δ ) be the maximum number such that the following holds: for every ∊ > 0 and $G = {\mathbb{F}}_2^n$ with n sufficiently large, if A ⊆ G × G with A ≥ δ | G | 2 , then there exists a nonzero “popular difference” d ∈ G such that the number ofmore »