The signless Laplacian Estrada index of tricyclic graphs
, 2014 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
On sum of powers of Laplacian eigenvalues and Laplacian Estrada index of graphs
, 2011 Let $G$ be a simple graph and $α$ a real number. The quantity $s_α(G)$ defined as the sum of the $α$-th power of the non-zero Laplacian eigenvalues of $G$ generalizes several concepts in the literature. The Laplacian Estrada index is a newly introduced graph invariant based on Laplacian eigenvalues.
openaire +2 more sources
What Is in a Simplicial Complex? A Metaplex-Based Approach to Its Structure and Dynamics. [PDF]
Entropy (Basel), 2023 Miranda M +2 more
europepmc +1 more source
Maximum signless Laplacian Estrada index of tetracyclic graphs
FilomatIn 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]
Int J Quantum Chem, 2023 Rauf A, Naeem M, Hanif A.
europepmc +1 more source
Novel Bounds for the Normalized Laplacian Estrada and Normalized Energy Index of Graphs
, 2015 For a simple and connected graph, several lower and upper bounds of graph invariants expressed in terms of the eigenvalues of the normalized Laplacian matrix have been proposed in literature. In this paper, through a unified approach based on majorization techniques, we provide some novel inequalities depending on additional information on the ...
Clemente, Gian Paolo +1 more
openaire +2 more sources
Network bypasses sustain complexity. [PDF]
Proc Natl Acad Sci U S A, 2023 Estrada E, Gómez-Gardeñes J, Lacasa L.
europepmc +1 more source
A network analysis of crab metamorphosis and the hypothesis of development as a process of unfolding of an intensive complexity. [PDF]
Sci Rep, 2021 Ostachuk A.
europepmc +1 more source
How the latent geometry of a biological network provides information on its dynamics: the case of the gene network of chronic myeloid leukaemia. [PDF]
Front Cell Dev Biol, 2023 Lecca P +3 more
europepmc +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation. [PDF]
Front Chem, 2023 Munir MM, Wusqa UT.
europepmc +1 more source