On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices

Mingzhu Chen and Bo Zhou

Applied Mathematics and Computation, 2017, vol. 305, issue C, 166-173

Abstract: The unique graphs with maximum spectral radius and signless Laplacian spectral radius are determined among trees, unicyclic graphs and bicyclic graphs respectively with fixed numbers of vertices and branch vertices (vertices of degree at least 3) using a unified approach.

Keywords: Spectral radius; Signless Laplacian spectral radius; Branch vertex; Tree; Unicyclic graph; Bicyclic graph (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317300929
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:305:y:2017:i:c:p:166-173

DOI: 10.1016/j.amc.2017.01.066

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 ().