Maximization of the spectral radius of block graphs with a given dissociation number

Joyentanuj Das and Sumit Mohanty

Applied Mathematics and Computation, 2024, vol. 465, issue C

Abstract: A connected graph is called a block graph if each of its blocks is a complete graph. Let Bl(k,φ) be the class of block graphs on k vertices with given dissociation number φ. In this article, we have shown the existence and uniqueness of a block graph Bk,φ in Bl(k,φ) that maximizes the spectral radius ρ(G) among all graphs G in Bl(k,φ). Furthermore, we also provide bounds on ρ(Bk,φ).

Keywords: Spectral radius; Dissociation number; Complete graphs; Bounds; Block graphs (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323005933
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:465:y:2024:i:c:s0096300323005933

DOI: 10.1016/j.amc.2023.128424

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