On eigenvalues and energy of geometric-arithmetic matrix of graphs (Q2134634): Difference between revisions

This manuscript deals with the calculus of the spectrum and the energy of the geometric-arithmetic matrix associated to a graph \(G\). \par A simple and undirected graph is denoted by \(G(V,E)\), where \(V=\{ v_1, v_2, \ldots, v_n \}\) and \(E\) are the vertex set and the edge set, respectively. If a vertex \(u\) is adjacent to a vertex \(v\), it is denoted \(u \sim v\). The degree of a vertex \(v\), denoted by \(d_G(v)\) or \(d_v\), is the cardinality of the set of vertices adjacent to \(v\), \(N(v)\). A graph is regular if all vertices have the same degree. \par The geometric-arithmetic matrix \(A=\mathcal{GA}(G)\) of \(G\) is a square matrix of size \(n \times n\), indexed by the vertices of \(G\) and defined as \[ (\mathcal{GA}(G))_{u,v}=\left\{ \begin{array} {ll} \dfrac{2\sqrt{d_v d_u}}{d_v+d_u}, & \mbox{if} \ v \sim u, \\ 0, & \mbox{otherwise}. \end{array} \right. \] In this paper, the authors calculate the geometric-arithmetic spectrum of the join of two regular graphs in terms of the adjacency spectrum of the two given graphs. As a consequence, they obtain the spectrum of some well-known families of graphs, including graphs with edge deletion. \par The energy of a graph \(G\), denoted by \(\varepsilon(G)\), is defined as the absolute sum of the adjacency eigenvalues, that is, \[ \varepsilon(G)=\sum_{i=1}^n |\lambda_i|. \] The geometric-arithmetic energy of graph \(G\) is defined in a similar way. The authors obtain several upper and lower bounds for this geometric-arithmetic energy and characterize the graphs attaining such bounds.