LAPLACIAN SPECTRA OF GRAPH BUNDLES

  • Kim, Ju-Young (Department of Mathematics, Catholic University of Taegu-Hyosung)
  • Published : 1996.10.01

Abstract

The spectrum of the Laplacian matrix of a graph gives an information of the structure of the graph. For example, the product of non-zero eigenvalues of the characteristic polynomial of the Laplacian matrix of a graph with n vertices is n times of the number of spanning trees of that graph. The characteristic polynomial of the Laplacian matrix of a graph tells us the number of spanning trees and the connectivity of given graph. in this paper, we compute the characteristic polynomial of the Laplacian matrix of a graph bundle when its voltage lie in an abelian subgroup of the full automorphism group of the fibre; in particular, the automorphism group of the fibre is abelian. Also we study a relation between the characteristic polynomial of the Laplacian matrix of a graph G and that of the Laplacian matrix of a graph bundle over G. Some applications are also discussed.

Keywords