The graphs with exactly two distance eigenvalues different from -1 and -3

DOI10.1007/S10801-016-0718-2zbMATH Open1358.05176arXiv1606.07551OpenAlexW2468861484MaRDI QIDQ517364FDOQ517364

Lu Lu, Qiongxiang Huang, Xueyi Huang

Publication date: 23 March 2017

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: In this paper, we completely characterize the graphs with third largest distance eigenvalue at most $-1$ and smallest distance eigenvalue at least $-3$. In particular, we determine all graphs whose distance matrices have exactly two eigenvalues (counting multiplicity) different from $-1$ and $-3$. It turns out that such graphs consist of three infinite classes, and all of them are determined by their distance spectra. We also show that the friendship graph is determined by its distance spectrum.

Full work available at URL: https://arxiv.org/abs/1606.07551

Recommendations

• On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
• On graphs with at least three distance eigenvalues less than \(-1\)
• Graphs with three distinct distance eigenvalues
• The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)
• The graphs with all but two eigenvalues equal to \(\pm 1\)

zbMATH Keywords

friendship graphdistance eigenvaluedistance equitable partitiondistance spectral characterization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• An introduction to the theory of graph spectra
• Proof of conjectures on adjacency eigenvalues of graphs
• On the least distance eigenvalue of a graph
• Complete multipartite graphs are determined by their distance spectra
• On the two largest \(Q\)-eigenvalues of graphs
• On graphs with at least three distance eigenvalues less than \(-1\)
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• On a property of the class of n-colorable graphs
• Graphs cospectral with a friendship graph or its complement

Cited In (19)

• On graphs with three distinct signless Laplacian eigenvalues
• Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
• On the sum of \(k\) largest distance eigenvalues of graphs
• Harary spectrum of generalized composition of graphs and Harary equienergetic graphs
• The complements of path and cycle are determined by their distance (signless) Laplacian spectra
• Graphs with three distinct distance eigenvalues
• Graphs whose distance matrix has at most three negative eigenvalues
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• On graphs with exactly one anti-adjacency eigenvalue and beyond
• On the D_α-spectra of graphs
• On the distance spectra of threshold graphs
• A relation between proximity and the third largest distance eigenvalue of a graph
• Eigenvalue-free intervals of distance matrices of threshold and chain graphs
• Distance eigenvalues of B(n, k)
• Distance eigenvalues of a cograph and their multiplicities
• Complex unit gain graphs with exactly one positive eigenvalue
• On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
• Title not available (Why is that?)
• Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra

This page was built for publication: The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)

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