Bounds on the α‐Distance Energy and α‐Distance Estrada Index of Graphs
Let G be a simple undirected connected graph, then Dα(G) = αTr(G) + (1 − α)D(G) is called the α‐distance matrix of G, where α ∈ [0,1], D(G) is the distance matrix of G, and Tr(G) is the vertex transmission diagonal matrix of G. In this paper, we study some bounds on the α‐distance energy and α‐distance Estrada index of G.
Yang Yang +3 more
wiley +1 more source
On some aspects of the generalized Petersen graph
Let $p \ge 3$ be a positive integer and let $k \in {1, 2, ..., p-1} \ \lfloor p/2 \rfloor$. The generalized Petersen graph GP(p,k) has its vertex and edge set as $V(GP(p, k)) = \{u_i : i \in Zp\} \cup \{u_i^\prime : i \in Z_p\}$ and $E(GP(p, k)) = \{u_i ...
V. Yegnanarayanan
doaj +1 more source
The study centered on Quantitative Structure Property Relationship (QSPR) analysis with a focus on various graph energies, investigating drugs like Mefloquinone, Sertraline, Niclosamide, Tizoxanide, PHA-690509, Ribavirin, Emricasan, and Sofosbuvir ...
Ali Raza, Muhammad Mobeen Munir
doaj +1 more source
The signless Laplacian Estrada index of tricyclic graphs
The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we show that there are exactly two tricyclic graphs with the maximal signless Laplacian Estrada index.
Nasiri, R. +4 more
openaire +4 more sources
New lower bounds for the Estrada and Signless Laplacian Estrada Index of a Graph
Let $G$ be a graph on $n$ vertices and $λ_1,λ_2,\ldots,λ_n$ its eigenvalues. The Estrada index of $G$ is defined as $EE(G)=\sum_{i=1}^n e^{λ_i}.$ In this work, using a different demonstration technique, new lower bounds are obtained for the Estrada index, that depends on the number of vertices, the number of edges and the energy of the graph is given ...
Aguayo, Juan L. +2 more
openaire +2 more sources
Maximum signless Laplacian Estrada index of tetracyclic graphs
In this study, we aim to determine the unique tetracyclic graph that maximizes the signless Laplacian Estrada index (SLEE) among all tetracyclic graphs. The SLEE of a graph ? is defined as the sum of the exponentials of its eigenvalues, expressed as follows: SLEE(?)=?n,i=1 esi, where s1, s2,...,sn are the eigenvalues of the signless Laplacian matrix ...
Palaniyappan Nithya +3 more
openaire +1 more source
Quantitative structure-properties relationship analysis of Eigen-value-based indices using COVID-19 drugs structure. [PDF]
Rauf A, Naeem M, Hanif A.
europepmc +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation. [PDF]
Munir MM, Wusqa UT.
europepmc +1 more source
On the signless Laplacian energy and signless Laplacian Estrada index of extremal graphs
R. Binthiya, P. B. Sarasija
openaire +1 more source
Predictive modeling for physicochemical properties of β-lactam antibiotics through eigenvalue based topological indices and non linear regression techniques. [PDF]
Yuvaraj A +4 more
europepmc +1 more source

