Equitable switching and spectra of graphs

DOI10.1016/S0024-3795(02)00434-2zbMath1015.05058MaRDI QIDQ1864966

Yasuo Teranishi

Publication date: 23 March 2003

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

Seidel switchingequitable partitiongraph switchingRamanujan graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Characteristic polynomials of ramified uniform covering digraphs ⋮ Characteristic polynomials and zeta functions of equitably partitioned graphs ⋮ Invariant subspace, determinant and characteristic polynomials ⋮ Characteristic polynomials of digraphs having a semi-free action

Cites Work

• Constructing cospectral graphs
• Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
• Problems in algebraic combinatorics
• Chromatic number and the 2-rank of a graph
• Distance-regularity and the spectrum of graphs
• Main eigenvalues of a graph
• THE SECOND LARGEST ELGENVALUES OF REGULAR BIPARTITE GRAPHS
• Unnamed Item
• Unnamed Item

This page was built for publication: Equitable switching and spectra of graphs