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

DOI10.1007/S10801-016-0718-2zbMath1358.05176arXiv1606.07551OpenAlexW2468861484MaRDI QIDQ517364

Xueyi Huang, Lu Lu, Qiong Xiang 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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items (16)

Harary spectrum of generalized composition of graphs and Harary equienergetic graphs ⋮ Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ On the distance spectra of threshold graphs ⋮ Unnamed Item ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ Graphs with three distinct distance eigenvalues ⋮ On graphs with exactly one anti-adjacency eigenvalue and beyond ⋮ Distance eigenvalues of a cograph and their multiplicities ⋮ Complex unit gain graphs with exactly one positive eigenvalue ⋮ On the sum of \(k\) largest distance eigenvalues of graphs ⋮ Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra ⋮ Distance eigenvalues of B(n, k) ⋮ The complements of path and cycle are determined by their distance (signless) Laplacian spectra ⋮ On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity ⋮ On the D_α-spectra of graphs ⋮ Eigenvalue-free intervals of distance matrices of threshold and chain graphs

Cites Work

• Unnamed Item
• On the two largest \(Q\)-eigenvalues of graphs
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Proof of conjectures on adjacency 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 the least distance eigenvalue of a graph
• Complete multipartite graphs are determined by their distance spectra
• On a property of the class of n-colorable graphs
• Graphs cospectral with a friendship graph or its complement

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