On Distance Spectral Radius and Distance Energy of Graphs

Details On Distance Spectral Radius and Distance Energy of Graphs On Distance Spectral Radius and Distance Energy of Graphs

2011-01-23

arxiv.org/abs/1101.4393v1

MATCH Commun. Math. Comput. Chem. 64 (2010) 261-280

Mathematics

Combinatorics

20 pages

Scientific paper

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix, and the distance energy is defined as the sum of the absolute values of the eigenvalues of its distance matrix. We establish lower and upper bounds for the distance spectral radius of graphs and bipartite graphs, lower bounds for the distance energy of graphs, and characterize the extremal graphs. We also discuss upper bounds for the distance energy.

Affiliated with

Also associated with

No associations

Rating

On Distance Spectral Radius and Distance Energy of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Distance Spectral Radius and Distance Energy of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Distance Spectral Radius and Distance Energy of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-587418