Mathematics · 2019 · 17 citations · 37 references
ComputingComputer ScienceComputer NetworksOptimizationWireless CommunicationsGraph AlgorithmsGraph TheoryNetwork Information TheoryLower BoundsMinimum DistanceNode Degree
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.
37
A Survey of Matrix Theory and Matrix Inequalities
A. S. H., Marvin Marcus, Henryk Minc · Mathematics of Computation · 1965 · 1.5K citations
Linear Algebra and its Applications · 2004 · 700 citations
İvan Gutman, Bo Zhou · Linear Algebra and its Applications · 2005 · 491 citations