AOSIS, Applicable Analysis and Discrete Mathematics, 1(5), p. 14-21
DOI: 10.2298/aadm110221011h
Export citation
Search in Google Scholar
Full text: Download
Let C(2m, k) be the set of all cactuses on 2m vertices, k cycles, and with perfect matchings. In this paper, we identify in C(2m, k) the unique graph with the largest spectral radius.