Contents

Ars Combinatoria

  • Research article

On the Spectral Radius of Cactuses with \(n\) Vertices and Edge Independence Number \(q\)

Shu-Guang Guo1
1 School of Mathematical Sciences, Yancheng Teachers University, Yancheng 224051, Jiangsu, P. R. China
  • Published: 31/07/2013

Abstract

A graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we determine the graph with the
largest spectral radius among all connected cactuses with n vertices and edge independence number \(q\).

Citation
Shu-Guang Guo. On the Spectral Radius of Cactuses with \(n\) Vertices and Edge Independence Number \(q\)[J], Ars Combinatoria, Volume 110. 265-274. .