On the second largest distance eigenvalue of a graph

DOI10.1080/03081087.2016.1221376zbMATH Open1360.05099arXiv1504.04225OpenAlexW1690774857MaRDI QIDQ2979480FDOQ2979480

Authors: Rui-fang Liu, Jie Xue, Litao Guo 

Publication date: 25 April 2017

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Abstract: Let $G$ be a simple connected graph of order $n$ and $D(G)$ be the distance matrix of $G.$ Suppose that $lambd{a}_1(D(G))geqlambd{a}_2(D(G))geqcdotsgeqlambd{a}_n(D(G))$ are the distance spectrum of $G$. A graph $G$ is said to be determined by its $D$-spectrum if with respect to the distance matrix $D(G)$, any graph with the same spectrum as $G$ is isomorphic to $G$. In this paper, we consider spectral characterization on the second largest distance eigenvalue $lambd{a}_2(D(G))$ of graphs, and prove that the graphs with $lambd{a}_2(D(G))leqfrac17-sqrt3292approx-0.5692$ are determined by their $D$-spectra.

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

Recommendations

• On the distance spectrum of graphs
• On the second largest distance eigenvalue
• The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)
• On the second least distance eigenvalue of a graph
• Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra

zbMATH Keywords

distance matrixthe second largest distance eigenvalue\(D\)-spectrum determined

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• Cospectral graphs and the generalized adjacency matrix
• On the least distance eigenvalue and its applications on the distance spread
• Complete multipartite graphs are determined by their distance spectra
• On the distance spectrum of graphs
• On graphs with at least three distance eigenvalues less than \(-1\)
• On the second largest distance eigenvalue
• The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)

Cited In (16)

• Graphs for which the second largest distance eigenvalue is less than \(- \frac{1}{2}\)
• Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
• The complements of path and cycle are determined by their distance (signless) Laplacian spectra
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Graphs determined by second smallest distance eigenvalues in given intervals
• Spectral characterization of graphs whose second largest eigenvalue is less than 1
• On the second largest distance eigenvalue of a block graph
• On the least distance eigenvalues of the second power of a graph
• The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)
• Title not available (Why is that?)
• The multiplicity of \(-2\) as an eigenvalue of the distance matrix of graphs
• On the second largest distance eigenvalue
• On the distance spectrum of graphs
• Quadratic embedding constants of graph joins
• On the distance spectrum of trees
• On the second largest eigenvalue of a mixed graph

This page was built for publication: On the second largest distance eigenvalue of a graph

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