共 50 条
On the spectral radius of unicyclic graphs with fixed girth
被引:0
|作者:
Li, Jianxi
[1
]
Guo, Ji-Ming
[2
]
Shiu, Wai Chee
[3
]
机构:
[1] Zhangzhou Normal Univ, Dept Math & Informat Sci, Fujian, Zhangzhou, Peoples R China
[2] China Univ Petr, Dept Appl Math, Dongying, Shandong, Peoples R China
[3] Hong Kong Baptist Univ, Dept Math, Kowloon Tong, Hong Kong, Peoples R China
来源:
基金:
美国国家科学基金会;
关键词:
Unicyclic graph;
girth;
characteristic polynomial;
spectral radius;
BICYCLIC GRAPHS;
N-VERTICES;
DIAMETER;
INDEX;
TREES;
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let u(n)(g) be the set of unicyclic graphs of order n with girth g. For all integers n and g with 5 <= g <= n 6, we determine the first leftperpendicularg/2rightperpendicular + 3 spectral radii of unicyclic graphs in the set u(n)(g).
引用
收藏
页码:65 / 80
页数:16
相关论文