图的补距离矩阵谱半径的最大值(英文)  

On maximal spectral radius of complementary distance matrix of graphs

作　　者：苏莉[1] 李红海[1] 

机构地区：[1]江西师范大学数信学院,江西南昌330022

出　　处：《浙江大学学报（理学版）》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)

摘　　要：在具有给定阶和匹配数且直径不超过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.

关 键 词：匹配数 补距离矩阵 谱半径 

分 类 号：O157.5[理学—数学]