共 50 条
On the spectral radius of tricyclic graphs with a fixed diameter
被引:6
作者:
Geng, Xianya
[1
]
Li, Shuchao
[1
]
机构:
[1] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Peoples R China
基金:
美国国家科学基金会;
关键词:
tricyclic graph;
eigenvalues;
spectral radius;
diameter;
UNICYCLIC GRAPHS;
BICYCLIC GRAPHS;
N-VERTICES;
TREES;
D O I:
10.1080/03081080903257630
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
A tricyclic graph is a connected graph with n vertices and n + 2 edges. In this article, we determine graphs with the largest spectral radius among the n-vertex tricyclic graphs with given diameter d.
引用
收藏
页码:41 / 56
页数:16
相关论文