Publications de l'Institut Mathématique, Nouvelle Série Vol. 92(106), pp. 117–125 (2012) 

ORDERING CACTI WITH n VERTICES AND k CYCLES BY THEIR LAPLACIAN SPECTRAL RADIIShuGuang Guo and YanFeng WangSchool of Mathematical Sciences, Yancheng Teachers University, Yancheng 224002, Jiangsu, P. R. ChinaAbstract: 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\geq 2k+8$. Classification (MSC2000): 0550 Full text of the article: (for faster download, first choose a mirror)
Electronic fulltext finalized on: 8 Nov 2012. This page was last modified: 19 Nov 2012.
© 2012 Mathematical Institute of the Serbian Academy of Science and Arts
