| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6416823 | Linear Algebra and its Applications | 2012 | 12 Pages |
Abstract
In this paper, we determine the unique graph with minimum distance spectral radius among all connected bipartite graphs of order n with a given matching number. Moreover, we characterize the graphs with minimal distance spectral radius in the class of all connected bipartite graphs with a given vertex connectivity.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Milan Nath, Somnath Paul,