Abstract
AbstractFor a connected graph G and $\alpha \in [0,1)$α∈[0,1), the distance α-spectral radius of G is the spectral radius of the matrix $D_{\alpha }(G)$Dα(G) defined as $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )D(G)$Dα(G)=αT(G)+(1−α)D(G), where $T(G)$T(G) is a diagonal matrix of vertex transmissions of G and $D(G)$D(G) is the distance matrix of G. We give bounds for the distance α-spectral radius, especially for graphs that are not transmission regular, propose local graft transformations that decrease or increase the distance α-spectral radius, and determine the graphs that minimize and maximize the distance α-spectral radius among several families of graphs.
Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献