Abstract
Suppose G is a connected simple graph with the vertex set \(V( G ) = \{ v_1,v_2,\cdots ,v_n \} \). Let \(d_G( v_i,v_j ) \) be the distance between \(v_i\) and \(v_j\). Then the distance matrix of G is \(D( G ) =( d_{ij} ) _{n\times n}\), where \(d_{ij}=d_G( v_i,v_j ) \). Since D(G) is a non-negative real symmetric matrix, its eigenvalues can be arranged \(\lambda _1(G)\ge \lambda _2(G)\ge \cdots \ge \lambda _n(G)\), where eigenvalues \(\lambda _1(G)\) and \(\lambda _n(G)\) are called the distance spectral radius and the least distance eigenvalue of G, respectively. In this paper, we characterize the unique graph whose distance spectral radius attains maximum and minimum among all complements of graphs with two pendent vertices, respectively. Furthermore, we determine the unique graph whose least distance eigenvalue attains minimum among all complements of graphs with two pendent vertices.
Similar content being viewed by others
References
M. Aouchiche, P. Hansen, Distance spectra of graphs: A survey, Linear Algebra and its Applications 458 (2014) 301-386.
S. Bose, M. Nath, S. Paul, On the maximal distance spectral radius of graphs without a pendant vertex, Linear Algebra and its Applications 438 (2013) 4260-4278.
X. Chen, G. Wang, The distance spectrum of the complements of graphs of diameter greater than three, Indian Journal Pure and Applied Mathematical, https://doi.org/10.1007/s13226-022-00315-9.
Y. Fan, F. Zhang, Y. Wang, The least eigenvalue of the complements of trees, Linear Algebra and its Applications 435 (2011) 2150-2155.
A. Ilic, Distance spectral radius of trees with given matching number, Discrete Applied Mathematics 158 (2010) 1799-1806.
G. Jiang, G. Yu, W. Sun, Z. Ruan, The least eigenvalue of graphs whose complements have only two pendent vertices, Applied Mathematics and Computation 331 (2018) 112-119.
H. Lin, On the least distance eigenvalue and its applications on the distance spread, Discrete Mathematics 338 (2015) 868-874.
H. Lin, S. Drury, On the distance spectrum of complements of trees, Linear Algebra and its Applications 530 (2017) 185-201.
H. Lin, B. Zhou, On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs, Linear Algebra and its Applications 443 (2014) 153-163.
S. Li, S. Wang, The least eigenvalue of the signless Laplacian of the complements of trees, Linear Algebra and its Applications 436 (2012) 2398-2405.
W. Ning, L. Ouyang, M. Lu, Distance spectral radius of trees with fixed number of pendant vertices, Linear Algebra and its Applications 439 (2013) 2240-2249.
R. Qin, D. Li, Y. Chen, J. Meng, The distance eigenvalues of the complements of unicyclic graphs, Linear Algebra and its Applications 598 (2020) 49–67.
G. Yu, Y. Fan, M. Ye, The least signless Laplacian eigenvalue of the complements of unicyclic graphs, Applied Mathematics and Computation 306 (2017) 13-21.
G. Yu, On the least distance eigenvalue of a graph, Linear Algebra and its Applications 439 (2013) 2428-2433.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Rahul Roy.
This work is supported by NSFC (No. 11461071)
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Chen, X., Wang, G. The distance spectrum of the complements of graphs with two pendent vertices. Indian J Pure Appl Math 54, 1069–1080 (2023). https://doi.org/10.1007/s13226-022-00322-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13226-022-00322-w
Keywords
- Distance matrix
- Distance spectral radius
- Least distance eigenvalue
- Complements of graphs
- Pendent vertices