The effect on the spectral radius by attaching a pendant starlike tree

Xin Li and Ji-Ming Guo

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

Abstract: A tree T with exactly one node u of degree larger than two is called a starlike tree and u is called the root node of T. Let STn be a family of graphs consists of all starlike trees and the path with n+1 nodes. For a fixed connected graph H with at least one edge, we construct a family of graphs FH(v),n={H(v)•T|T∈STn}, where H(v)•T denotes the graph obtained by identifying some node, say v, of H with the root node of T. In this paper, we give an ordering of graphs in FH(v),n by spectral radii coincides with the shortlex ordering of nondecreasing sequences of their branch lengths.

Keywords: Starlike tree; Spectral radius; Order (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

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

DOI: 10.1016/j.amc.2024.128818

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