On Maximal Distance Energy

Shaowei Sun, Kinkar Chandra Das and Yilun Shang
Additional contact information
Shaowei Sun: School of Science, Zhejiang University of Science and Technology, Hangzhou 310023, China
Kinkar Chandra Das: Department of Mathematics, Sungkyunkwan University, Suwon 16419, Korea
Yilun Shang: Department of Computer and Information Sciences, Northumbria University, Newcastle NE1 8ST, UK

Mathematics, 2021, vol. 9, issue 4, 1-7

Abstract: Let G be a graph of order n . If the maximal connected subgraph of G has no cut vertex then it is called a block. If each block of graph G is a clique then G is called clique tree. The distance energy E D ( G ) of graph G is the sum of the absolute values of the eigenvalues of the distance matrix D ( G ) . In this paper, we study the properties on the eigencomponents corresponding to the distance spectral radius of some special class of clique trees. Using this result we characterize a graph which gives the maximum distance spectral radius among all clique trees of order n with k cliques. From this result, we confirm a conjecture on the maximum distance energy, which was given in Lin et al. Linear Algebra Appl 467(2015) 29-39.

Keywords: distance matrix; distance spectral radius; distance energy (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/4/360/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/4/360/ (text/html)

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:gam:jmathe:v:9:y:2021:i:4:p:360-:d:497508

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().