On the Generalized Distance Energy of Graphs

Alhevaz, Abdollah, Baghipur, Maryam, Ganie, Hilal Ahmad and Shang, Yilun (2019) On the Generalized Distance Energy of Graphs. Mathematics, 8 (1). p. 7. ISSN 2227-7390

Preview

Text mathematics-08-00017.pdf - Published Version Available under License Creative Commons Attribution 4.0. Download (289kB) | Preview

Abstract

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 - α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

Actions (login required)

View Item

Downloads