DocumentCode
293218
Title
Spectra of graphs with circulant blocks and their applications
Author
Wojciechowski, Jacek ; Vlach, Jiri
Author_Institution
Inst. of Electron. Fundamentals, Warsaw Univ. of Technol., Poland
Volume
5
fYear
1994
fDate
30 May-2 Jun 1994
Firstpage
161
Abstract
A class of graphs with circulant blocks, i.e. graphs which can be decomposed into circulant subgraphs, is considered. A closed form formula for eigenvalues of the decomposed graph in terms of eigenvalues of partition subgraphs is given. Decomposition into two layer graph is distinguished as the most computationally effective case. A formula for counting spanning trees in graphs with circulant blocks, based on eigenvalues, is introduced. Illustrative examples test the method
Keywords
eigenvalues and eigenfunctions; graph theory; trees (mathematics); circulant blocks; class; decomposition; eigenvalues; graphs; partition subgraphs; spanning trees; spectra; Algebra; Eigenvalues and eigenfunctions; Matrix decomposition; Polynomials; Symmetric matrices; Terminology; Testing; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1994. ISCAS '94., 1994 IEEE International Symposium on
Conference_Location
London
Print_ISBN
0-7803-1915-X
Type
conf
DOI
10.1109/ISCAS.1994.409328
Filename
409328
Link To Document