文献类型：期刊文献

英文题名：Aα-spectral radius of the second power of a graph

作者：Chen, Yuanyuan[1];Li, Dan[1];Wang, Zhiwen[2];Meng, Jixiang[1]

机构：[1]Xinjiang Univ, Coll Math & Syst Sci, Urumqi, Xinjiang, Peoples R China;[2]East China Univ Sci & Technol, Dept Math, Shanghai, Peoples R China

年份：2019

卷号：359

起止页码：418

外文期刊名：APPLIED MATHEMATICS AND COMPUTATION

收录：;EI(收录号：20192006935051);WOS:【SCI-EXPANDED(收录号:WOS:000469203800028)】；

基金：This research is supported by NSFC (No. 11531011), XJTCDP (No. 04231200746), XJUDP (No. 62031224601).

语种：英文

外文关键词：kth power of a graph; Tree; A(alpha)-spectral radius

摘要：The kth power of a graph G, denoted by G(k), is a graph with the same set of vertices as G such that two vertices are adjacent in G(k) if and only if their distance in G is at most k. In this paper, we give upper and lower bounds on the A(alpha)-spectral radius of G(2). Furthermore, the first three largest A(alpha)-spectral radius of the second power of trees are determined. (C) 2019 Published by Elsevier Inc.