Extremal Kragujevac Trees with Respect to Randic Energy
نویسندگان
1 Department of Science, Arak University of Technology, Arak, Iran
doi
10.22052/ijmc.2025.255399.1897چکیده
Let $G$ be a simple graph with vertex set $V(G)=\{v_1, v_2,\dots,v_n\}$. The Randi\'c matrix of G, represented as R(G), is defined as the $n \times n$ matrix whose $(i, j)$-entry is $(d_id_j)^{\frac{-1}{2}}$ if $v_i$ and $v_j$ are adjacent and 0 otherwise. The Randi\'c energy of graph G is the sum of absolute values of the eigenvalues of R(G). In this study, we determine the Kragujevac trees with a fixed degree and fixed order that have maximal and minimal Randić energy. Additionally, we obtain upper and lower bounds for the Randić energy of these trees.