Extremal cacti of given matching number with respect to the distance spectral radius

Minjie Zhang and Shuchao Li

Applied Mathematics and Computation, 2016, vol. 291, issue C, 89-97

Abstract: A cactus is a connected graph in which any two cycles have at most one common vertex. The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Recently, many researchers proposed the use of ρ(G) as a molecular structure descriptor of alkanes. In this paper, we characterize n-vertex cyclic cactus with given matching number m which minimizes the distance spectral radius. The resulting cactus also minimizes the Hosoya index, the Wiener index and the Randić index in the same class of graphs.

Keywords: Distance spectral radius; Cactus; Matching number; Perfect matching (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316304027
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:291:y:2016:i:c:p:89-97

DOI: 10.1016/j.amc.2016.06.031

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().