Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs

被引：6
|
作者：
Atik, Fouzul [1 ]
Panigrahi, Pratima [1 ]
机构：
[1] Indian Inst Technol, Dept Math, Kharagpur 721302, W Bengal, India
来源：
ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2016 | 2016年 / 9602卷
关键词：
Distance matrix; Distance eigenvalue; Distance spectral radius; k-partitioned transmission regular graphs; Generalized petersen graphs; LARGEST EIGENVALUE; MATRIX; INDEXES; INVARIANTS; TREES;
D O I：
10.1007/978-3-319-29221-2_3
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The distance matrix of a simple graph G is D(G) = (d(i, j)), where d(i, j) is the distance between the ith and jth vertices of G. The distance spectral radius of G, written lambda(1)(G), is the largest eigenvalue of D(G). We determine the distance spectral radius of the wheel graph W-n, a particular type of spider graphs, and the generalized Petersen graph P(n, k) for k is an element of {2, 3}.
引用
收藏
页码：26 / 36
页数：11
相关论文
共 50 条
12345