TY - JOUR
ID - 14178
TI - Two upper bounds on the A_α-spectral radius of a connected graph
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Pirzada, Shariefuddin
AD - Department of Mathematics, Hazratbal
Y1 - 2022
PY - 2022
VL - 7
IS - 1
SP - 53
EP - 57
KW - Adjacency matrix
KW - generalized adjacency matrix
KW - spectral radius
KW - clique number
DO - 10.22049/cco.2021.27061.1187
N2 - If $A(G)$ and $D(G)$ are respectively the adjacency matrix and the diagonal matrix of vertex degrees of a connected graph $G$, the generalized adjacency matrix $A_{alpha}(G)$ is defined as $A_{alpha}(G)=alpha ~D(G)+(1-alpha)~A(G)$, where $0leq alpha leq 1$. The $A_{alpha}$ (or generalized) spectral radius $lambda(A_{alpha}(G))$ (or simply $lambda_{alpha}$) is the largest eigenvalue of $A_{alpha}(G)$. In this paper, we show that
$$ lambda_{alpha}leq alpha~Delta +(1-alpha)sqrt{2mleft(1-frac{1}{omega}right)}, $$where $m$, $Delta$ and $omega=omega(G)$ are respectively the size, the largest degree and the clique number of $G$. Further, if $G$ has order $n$, then we show that
begin{equation*} lambda_{alpha}leq frac{1}{2}maxlimits_{1leq ileq n} left[alpha d_{i}+sqrt{ alpha^{2}d_{i}^{2}+4m_{i}(1-alpha)[alpha+(1-alpha)m_{j}] }right],end{equation*}where $d_{i}$ and $m_{i}$ are respectively the degree and the average 2-degree of the vertex $v_{i}$.
UR - http://comb-opt.azaruniv.ac.ir/article_14178.html
L1 - http://comb-opt.azaruniv.ac.ir/article_14178_9ff8635c0123896b88601cc9982321d9.pdf
ER -