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

DOI10.1007/S10801-016-0718-2MaRDI QIDQ517364zbMATH OpenOpenAlexFDO

Authors Xueyi Huang, Lu Lu, Qiongxiang Huang

Publication date 23 March 2017

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

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

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)

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.

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\)

Cites work

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

Cited in

(28)

• On the distance spectra of graphs
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• On graphs with three distinct signless Laplacian eigenvalues
• On the sum of k largest distance eigenvalues of graphs
• The complements of path and cycle are determined by their distance (signless) Laplacian spectra
• Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
• Harary spectrum of generalized composition of graphs and Harary equienergetic graphs
• Graphs with three distinct distance eigenvalues
• Graphs whose distance matrix has at most three negative eigenvalues
• On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Some graphs determined by their distance spectrum
• On graphs with exactly one anti-adjacency eigenvalue and beyond
• On the distance spectra of threshold graphs
• On the eigenvalues of the distance matrix of graphs with given number of pendant vertices
• A relation between proximity and the third largest distance eigenvalue of a graph
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• Eigenvalue-free intervals of distance matrices of threshold and chain graphs
• On the \(D_\alpha\)-spectra of graphs
• Distance eigenvalues of a cograph and their multiplicities
• Balaban index of bicyclic chain graphs
• Complex unit gain graphs with exactly one positive eigenvalue
• Graphs with all but two eigenvalues in \([-2, 0]\)
• Spectral determination of graphs with one positive anti-adjacency eigenvalue
• On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
• On the distance cospectrality of threshold graphs
• Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra
• Distance eigenvalues of \(B(n, k)\)

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)