Graphs with three distinct distance eigenvalues

Yuke Zhang and Huiqiu Lin

Applied Mathematics and Computation, 2023, vol. 445, issue C

Abstract: In this paper, some special distance spectral properties of graphs are considered. Concretely, we recursively construct an infinite family of trees with distance eigenvalue −1, and determine all triangle-free connected graphs with three distinct distance eigenvalues of which the smallest one is equal to −3. Furthermore, we characterize all trees with three distinct distance eigenvalues.

Keywords: Distance eigenvalues; Distinct eigenvalues (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323000176
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:445:y:2023:i:c:s0096300323000176

DOI: 10.1016/j.amc.2023.127848

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().