The distance spectrum of the complements of graphs of diameter greater than three

Xu Chen and Guoping Wang ()
Additional contact information
Xu Chen: Xinjiang University of Finance & Economics
Guoping Wang: Xinjiang Normal University

Indian Journal of Pure and Applied Mathematics, 2023, vol. 54, issue 4, 959-965

Abstract: Abstract Suppose G is a connected simple graph with the vertex set $$V( G ) = \{ v_1,v_2,\cdots ,v_n \} $$ V ( G ) = { v 1 , v 2 , ⋯ , v n } . Let $$d_G( v_i,v_j ) $$ d G ( v i , v j ) be the least distance between $$v_i$$ v i and $$v_j$$ v j in G. Then the distance matrix of G is $$D( G ) =( d_{ij} ) _{n\times n}$$ D ( G ) = ( d ij ) n × n , where $$d_{ij}=d_G( v_i,v_j ) $$ 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)$$ λ 1 ( G ) ≥ λ 2 ( G ) ≥ ⋯ ≥ λ n ( G ) , where eigenvalues $$\lambda _1(G)$$ λ 1 ( G ) and $$\lambda _n(G)$$ λ 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 of diameter greater than three, respectively. Furthermore, we determine the unique graph whose least distance eigenvalue attains minimum among all complements of graphs of diameter greater than three.

Keywords: Distance matrix; Diameter; Distance spectral radius; Least distance eigenvalues; Complements of graphs; 05C12; 05C50 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-022-00315-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:54:y:2023:i:4:d:10.1007_s13226-022-00315-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-022-00315-9

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().