Characteristic polynomials and zeta functions of equitably partitioned graphs
Abstract
Let π=\V1,…,Vr\ be an equitable partition of the vertex set of a directed graph (digraph) X. It is well known that the characteristic polynomial φ(X/π,x) of a quotient graph X/π divides that of X, but the remainder part is not well investigated. In this paper, we define a deletion graph Xπ over an equitable partition π, which is a signed directed graph defined for a fixed set of deleting vertices \vi∈ Vi, i=1,·s,r\, and give a similarity transformation exchanging the adjacency matrix A(X) which is compatible with the equitable partition for a block triangular matrix whose diagonal blocks are the adjacency matrix of the quotient graph and the deletion graph. In fact, we show the result for more general matrices including adjacency matrix of graphs, and as corollaries, we show the followings: (i) a decomposition formula of the reciprocal of the Ihara-Bartholdi zeta function over an equitably partitioned undirected graph into the quotient graph part and the deletion graph part, and (ii) Chen and Chen's result ([CC17, Theorem 3.1]) on the Ihara-Bartholdi zeta functions on generalized join graphs, and (iii) Teranishi's result [Ter03, Theorem 3.3].
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.