ORDERING n-VERTEX CACTI WITH MATCHING NUMBER q BY THEIR SPECTRAL RADII

摘要

A connected graph G is a cactus if any two of its cycles have at most one common vertex. Denote by are determined. Consequently, the first two largest spectral radii together with cacti having perfect matchings are also determined.