Graphs with constant and
From MaRDI portal
Publication:1379987
A graph has constants \(\mu\) and \(\overline\mu\) if any two nonadjacent vertices have \(\mu\) common neighbours and any two adjacent vertices are both nonadjacent to \(\overline\mu\) vertices. It is proved that a connected graph \(G\) has constants \(\mu\) and \(\overline\mu\) if and only if the Laplacian of \(G\) has two distinct nonzero eigenvalues. Some constructions of such graphs are given.
Recommendations
Cites work
- An infinite sequence of \(\Gamma{}\Delta{}\)-regular graphs
- Combinatorial matrix theory
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 3708460 (Why is no real title available?)
- scientific article; zbMATH DE number 3756498 (Why is no real title available?)
- scientific article; zbMATH DE number 17112 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3432307 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- Modular Hadamard matrices and related designs. I
- Regular graphs with four eigenvalues
- Regular two-graphs on 36 vertices
- Square λ-Linked Designs
Cited in
(38)- Nonregular graphs with three eigenvalues
- Bounds on special subsets in graphs, eigenvalues and association schemes
- Graphs with fourth Laplacian eigenvalue less than two
- Which graphs are determined by their spectrum?
- Bipartite graphs with small third Laplacian eigenvalue.
- Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs
- 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
- Graphs with three distinct -eigenvalues
- On the multiplicity of the least signless Laplacian eigenvalue of a graph
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- The Laplacian spectral excess theorem for distance-regular graphs
- A relative bound for independence
- On the resistance matrix of a graph
- Critical groups of strongly regular graphs and their generalizations
- The Laplacian spread of graphs.
- Hypercubes are determined by their distance spectra
- A note on graphs whose signless Laplacian has three distinct eigenvalues
- A NOTE ON NORMALISED HEAT DIFFUSION FOR GRAPHS
- Graphs with few matching roots
- On bipartite graphs with small number of laplacian eigenvalues greater than two and three
- On the extension of connected irregular (λ,μ)-graphs
- On graphs with three distinct signless Laplacian eigenvalues
- 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
- Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\)
- Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
- On the independence number of regular graphs of matrix rings
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues
- Graphs with four distinct Laplacian eigenvalues
- An odd characterization of the generalized odd graphs
- More on topological indices and their reciprocals
- Algebraic bounds for the independence and chromatic number of graph powers
- Graphs whose Laplacian eigenvalues are almost all 1 or 2
- Algebraic bounds on the chromatic number and independent sets of graphs
- On graphs with three distinct Laplacian eigenvalues
- Smith normal form and Laplacians
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)
