On the structure of Laplace characteristic polynomial for circulant foliation
Abstract
In this paper, we describe the structure of the Laplace characteristic polynomial n(λ) for the infinite family of graphs Hn=Hn(G1,\,G2,…,Gm) obtained as a circulant foliation over a graph H on m vertices with fibers G1,\,G2,…,Gm. Each fiber Gi=Cn(si,1,\,si,2,…,si,ki) of this foliation is the circulant graph on n vertices with jumps si,1,\,si,2,…,si,ki. This family includes the family of generalized Petersen graphs, I-graphs, sandwiches of circulant graphs, discrete torus graphs and others. We show that the characteristic polynomial for such graphs can be decomposed into a finite product of algebraic functions evaluated at the roots of a linear combination of Chebyshev polynomials. Also, we prove that the characteristic polynomial can be represented in the form n(λ)=p(λ)\,H(λ)a(n)2, where a(n) is a sequence of integer polynomials and p(λ) is a prescribed integer polynomial. Moreover, we use the obtained results to produce analytic formulas for spectral graph invariants, such as the number of spanning trees and the number of spanning rooted forests.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.