Connectivity and Minimal Distance Spectral Radius of Graphs

Mathematics – Spectral Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages,1 figure

Scientific paper

In this paper, we study how the distance spectral radius behaves when the
graph is perturbed by grafting edges. As applications, we also determine the
graph with $k$ cut vertices (respectively, $k$ cut edges) with the minimal
distance spectral radius.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Connectivity and Minimal Distance Spectral Radius 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 Connectivity and Minimal Distance Spectral Radius of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connectivity and Minimal Distance Spectral Radius of Graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-493233

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.