On Maximal Distance Energy

Sun, Shaowei, Das, Kinkar Chandra and Shang, Yilun (2021) On Maximal Distance Energy. Mathematics, 9 (4). p. 360. ISSN 2227-7390

Preview

Text mathematics-09-00360.pdf - Published Version Available under License Creative Commons Attribution 4.0. Download (237kB) | Preview

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 ED(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.

Actions (login required)

View Item

Downloads