Graphs with constant and

DOI10.1016/S0012-365X(97)00150-7zbMATH Open0901.05068OpenAlexW2073780883MaRDI QIDQ1379987FDOQ1379987

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

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^∗

zbMATH Keywords

eigenvaluesLaplacian

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Interlacing eigenvalues and graphs
• Combinatorial matrix theory
• Regular graphs with four eigenvalues
• Square λ-Linked Designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular two-graphs on 36 vertices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modular Hadamard matrices and related designs. I
• An infinite sequence of \(\Gamma{}\Delta{}\)-regular graphs
• Title not available (Why is that?)

Cited In (35)

• 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
• Bounds on special subsets in graphs, eigenvalues and association schemes
• Smith normal form and Laplacians
• 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
• Spectral upper bound on the quantum k-independence number of a graph
• On graphs with three distinct Laplacian eigenvalues
• The Laplacian spectral excess theorem for distance-regular graphs
• Graphs with four distinct Laplacian eigenvalues
• On the multiplicity of the least signless Laplacian eigenvalue of a graph
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• Nonregular graphs with three eigenvalues
• Universal adjacency matrices with two eigenvalues
• On the independence number of regular graphs of matrix rings
• Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
• Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
• Graphs with three distinct \(\alpha\)-eigenvalues
• On the extension of connected irregular (λ,μ)-graphs
• Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach
• Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
• Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs
• The Laplacian spread 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)