共 50 条
On the distance spectral radius of bipartite graphs
被引:34
|作者:
Nath, Milan
[1
]
Paul, Somnath
[1
]
机构:
[1] Tezpur Univ, Dept Math Sci, Tezpur 784028, India
关键词:
Distance matrix;
Distance spectral radius;
Marching number;
Vertex connectivity;
MATRIX;
ENERGY;
D O I:
10.1016/j.laa.2011.07.031
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
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. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:1285 / 1296
页数:12
相关论文