English

On the structure of Laplace characteristic polynomial for circulant foliation

Combinatorics 2025-02-04 v2

Abstract

In this paper, we describe the structure of the Laplace characteristic polynomial χn(λ)\chi_n(\lambda) for the infinite family of graphs Hn=Hn(G1,G2,,Gm)H_n=H_n(G_1,\,G_2,\ldots,G_m) obtained as a circulant foliation over a graph HH on mm vertices with fibers G1,G2,,Gm.G_1,\,G_2,\ldots,G_m. Each fiber Gi=Cn(si,1,si,2,,si,ki)G_i=C_n(s_{i,1},\,s_{i,2},\ldots,s_{i,k_i}) of this foliation is the circulant graph on nn vertices with jumps si,1,si,2,,si,ki.s_{i,1},\,s_{i,2},\ldots,s_{i,k_i}. This family includes the family of generalized Petersen graphs, II-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,\chi_n(\lambda)=p(\lambda)\,\chi_H(\lambda)a(n)^2, where a(n)a(n) is a sequence of integer polynomials and p(λ)p(\lambda) 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.

Keywords

Cite

@article{arxiv.2111.04297,
  title  = {On the structure of Laplace characteristic polynomial for circulant foliation},
  author = {Young Soo Kwon and Alexander Mednykh and Ilya Mednykh},
  journal= {arXiv preprint arXiv:2111.04297},
  year   = {2025}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1902.05681 Replacement is done to show more general statements. The results of the previous variant is completely covered by the present one