Graphs with four distinct Laplacian eigenvalues
Let \(G\) be a graph with the vertex set \(\{v_1,\ldots,v_n\}\). The adjacency matrix of \(G\) is an \(n\times n\) matrix \(A(G)\) whose \((i, j)\)-entry is 1 if \(v_i\) is adjacent to \(v_j\) and 0 otherwise. The matrix \(L(G) = D(G)-A(G)\) is called the Laplacian matrix of \(G\) where \(D(G)\) is the diagonal matrix whose \(i\)-the entry on the diagonal is the degree of \(v_i\). Graphs with few distinct adjacency (Laplacian) eigenvalues form an interesting class of graphs and possess nice combinatorial properties. Following \textit{E. R. van Dam} and \textit{W. H. Haemers} [``Graphs with constant \(\mu\) and \(\bar\mu\), Discrete Math. 182, No. 1-3, 293--307 (1998; Zbl 0901.05068)] who studied the nonregular graphs with three Laplacian eigenvalues, the authors investigate connected nonregular graphs with four distinct Laplacian eigenvalues. They characterize all such graphs which are bipartite, namely they prove that a connected bipartite graph \(G\) with \(n\geq5\) vertices has four distinct Laplacian eigenvalues if and only if \(G\) is one of {\parindent=6mm \begin{itemize}\item[1)]the incidence graph of a symmetric design, \item[2)]the graph obtained from the incidence graph of the Fano plane or its complement by joining one new vertex to all the vertices of one part, \item[3)]the graph obtained from the complete bipartite graph \(K_{n,n}\) by removing one edge, or \item[4)]\(K_{r, n-r}\) with \(1 < r < n/2\). \end{itemize}} Connected nonregular graphs with four distinct Laplacian eigenvalues with exactly one multiple eigenvalue are also classified.
- A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
- A nonregular analogue of conference graphs
- A sharp upper bound for the number of spanning trees of a graph
- An improved upper bound for Laplacian graph eigenvalues
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- Combinatorial designs with two singular values. II: Partial geometric designs
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- Laplacian graph eigenvectors
- Multiplicative cones - a family of three eigenvalue graphs
- Nonregular graphs with three eigenvalues
- On graphs with equal algebraic and vertex connectivity
- On graphs with three distinct Laplacian eigenvalues
- On graphs with three eigenvalues
- Regular graphs with four eigenvalues
- Small regular graphs with four eigenvalues
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- Graphs with fourth Laplacian eigenvalue less than two
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
- Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
- On graphs with distance Laplacian spectral radius of multiplicity \(n-3\)
- Monotonic normalized heat diffusion for regular bipartite graphs with four eigenvalues
- Seidel spectrum of threshold graphs
- On the multiplicity of the least signless Laplacian eigenvalue of a graph
- Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
- Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues
- Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs
- Characterization of split graphs with at most four distinct eigenvalues
- The eigenvalues of the graphs \(D(4,q)\)
- Some results on the Laplacian spread of a graph
- On graphs with distinct eigenvalues
- On regular graphs with four distinct eigenvalues
- On graphs with three or four distinct normalized Laplacian eigenvalues
- On graphs with three distinct signless Laplacian eigenvalues
- On Laplacian-energy-like invariant and incidence energy
- Trees with Four and Five Distinct Signless Laplacian Eigenvalues
- Spectra of Laplacian matrices of semiregular bipartite graphs
- On graphs whose Laplacian matrices have distinct integer eigenvalues
- On the multiplicities of distance Laplacian eigenvalues
- Regular graphs of degree at most four that allow two distinct eigenvalues
- Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues
- On split graphs with three or four distinct (normalized) Laplacian eigenvalues
- On Laplacian energy in terms of graph invariants
- Graphs whose Laplacian eigenvalues are almost all 1 or 2
This page was built for publication: Graphs with four distinct Laplacian eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644702)
