ORDERING CACTI WITH n VERTICES AND k CYCLES BY THEIR LAPLACIAN SPECTRAL RADII

被引：0
|
作者：
Guo, Shu-Guang [1 ]
Wang, Yan-Feng [1 ]
机构：
[1] Yancheng Teachers Univ, Sch Math Sci, Yancheng 224002, Jiangsu, Peoples R China
来源：
PUBLICATIONS DE L INSTITUT MATHEMATIQUE-BEOGRAD | 2012年 / 92卷 / 106期
基金：
中国国家自然科学基金;
关键词：
TREES; GRAPH;
D O I：
10.2298/PIM1206117G
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we determine the first sixteen largest Laplacian spectral radii together with the corresponding graphs among all connected cacti with n vertices and k cycles, where n >= 2k + 8.
引用
收藏
页码：117 / 125
页数：9
相关论文
共 50 条
12345