Graphs with constant \(\mu\) and \(\overline{\mu}\)

DOI10.1016/S0012-365X(97)00150-7zbMath0901.05068OpenAlexW2073780883MaRDI QIDQ1379987

Willem H. Haemers, van Dam, Edwin R.

Publication date: 24 March 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00150-7

zbMATH Keywords

eigenvaluesLaplacian

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (34)

Hypercubes are determined by their distance spectra ⋮ The Laplacian spread of graphs ⋮ On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ On the extension of connected irregular (λ,μ)-graphs ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ Graphs with few matching roots ⋮ Bounds on special subsets in graphs, eigenvalues and association schemes ⋮ Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs ⋮ Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ Critical groups of strongly regular graphs and their generalizations ⋮ Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues ⋮ Graphs with fourth Laplacian eigenvalue less than two ⋮ On the independence number of regular graphs of matrix rings ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ Which graphs are determined by their spectrum? ⋮ Graphs with four distinct Laplacian eigenvalues ⋮ An odd characterization of the generalized odd graphs ⋮ Bipartite graphs with small third Laplacian eigenvalue. ⋮ A NOTE ON NORMALISED HEAT DIFFUSION FOR GRAPHS ⋮ On graphs with three distinct Laplacian eigenvalues ⋮ A note on graphs whose signless Laplacian has three distinct eigenvalues ⋮ Graphs with three distinct \(\alpha\)-eigenvalues ⋮ Smith normal form and Laplacians ⋮ The Laplacian spectral excess theorem for distance-regular graphs ⋮ Spectral upper bound on the quantum k-independence number of a graph ⋮ Universal adjacency matrices with two eigenvalues ⋮ Graphs whose normalized Laplacian has three eigenvalues ⋮ Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\) ⋮ Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach ⋮ Nonregular graphs with three eigenvalues ⋮ A relative bound for independence ⋮ On bipartite graphs with small number of laplacian eigenvalues greater than two and three ⋮ On the resistance matrix of a graph

Cites Work

• An infinite sequence of \(\Gamma{}\Delta{}\)-regular graphs
• Regular graphs with four eigenvalues
• Regular two-graphs on 36 vertices
• Interlacing eigenvalues and graphs
• Modular Hadamard matrices and related designs. I
• Square λ-Linked Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs with constant \(\mu\) and \(\overline{\mu}\)