Aα-spectral radius of the second power of a graph

Yuanyuan Chen, Dan Li, Zhiwen Wang and Jixiang Meng

Applied Mathematics and Computation, 2019, vol. 359, issue C, 418-425

Abstract: The kth power of a graph G, denoted by Gk, is a graph with the same set of vertices as G such that two vertices are adjacent in Gk if and only if their distance in G is at most k. In this paper, we give upper and lower bounds on the Aα-spectral radius of G2. Furthermore, the first three largest Aα-spectral radius of the second power of trees are determined.

Keywords: kth power of a graph; Tree; Aα-spectral radius (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319303790
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:359:y:2019:i:c:p:418-425

DOI: 10.1016/j.amc.2019.04.077

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