Extremal Unicyclic Graphs With Minimal Distance Spectral Radius

Abstract

The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3). In this paper, we determine the extremal unicyclic graph which has minimal distance spectral radius in U (n,m) \ Cn.

Keywords

• distance matrix
• distance spectral radius
• unicyclic graph
• matching.