Graphs with constant and

DOI10.1016/S0012-365X(97)00150-7MaRDI QIDQ1379987zbMATH OpenOpenAlexFDO

Authors Willem H. Haemers, Edwin R. Van Dam

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

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

Recommendations

Minimum higher eigenvalues of Laplacians on graphs
Graphs with four distinct Laplacian eigenvalues
On Laplacian eigenvalues of connected graphs.
Eigenvalues of the Laplacian of a graph^∗

Cited in

(38)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379987)