摘要
在具有给定阶和匹配数且直径不超过2的所有连通简单图中,确定了具有最大补距离矩阵谱半径的图.
We determine the graphs with maximal spectral radius of the complementary distance matrix among simple connected graphs with fixed order and matching number and diameter less than or equal to 2.
出处
《浙江大学学报(理学版)》
CAS
CSCD
2013年第1期11-14,共4页
Journal of Zhejiang University(Science Edition)
基金
Supported by National Natural Sciences Foundation of China(11201198,11026143)
Natural Science Foundation of Jiangxi Province(2010GQS0095,2010GZS0093)
Natural Science Fund of Jiangxi Normal University(4555)
关键词
匹配数
补距离矩阵
谱半径
matching number
complementary distance matrix
spectral radius.