Results 1 to 10 of about 150 (120)
Estrada Index and Laplacian Estrada Index of Random Interdependent Graphs [PDF]
Let G be a simple graph of order n. The Estrada index and Laplacian Estrada index of G are defined by E E ( G ) = ∑ i = 1 n e λ i ( A ( G ) ) and L E E ( G ) = ∑ i = 1 n e λ i ( L ( G ) ) , where { λ i
Yilun Shang
doaj +4 more sources
As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G.
Shang Yilun
doaj +5 more sources
The normalized signless laplacian estrada index of graphs [PDF]
Let $G$ be a simple connected graph of order $n$ with $m$ edges. Denote by $% \gamma _{1}^{+}\geq \gamma _{2}^{+}\geq \cdots \geq \gamma _{n}^{+}\geq 0$ the normalized signless Laplacian eigenvalues of $G$. In this work, we define the normalized signless
Ş. Burcu Bozkurt Altındağ +3 more
doaj +2 more sources
A Model for Evolutionary Structural Plasticity and Synchronization of a Network of Neurons. [PDF]
A model of time‐dependent structural plasticity for the synchronization of neuron networks is presented. It is known that synchronized oscillations reproduce structured communities, and this synchronization is transient since it can be enhanced or suppressed, and the proposed model reproduces this characteristic.
Solís-Perales G, Estrada JS.
europepmc +2 more sources
Quantile graphs for EEG-based diagnosis of Alzheimer's disease. [PDF]
Known as a degenerative and progressive dementia, Alzheimer's disease (AD) affects about 25 million elderly people around the world. This illness results in a decrease in the productivity of people and places limits on their daily lives ...
Aruane M Pineda +3 more
doaj +2 more sources
Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs. [PDF]
Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving
Yilun Shang
doaj +2 more sources
On maximum signless Laplacian Estrada index of graphs with given parameters II [PDF]
The signless Laplacian Estrada index of a graph G is defined as SLEE(G) = ∑ni = 1eqi where q1, q2, …, qn are the eigenvalues of the signless Laplacian matrix of G.
Ramin Nasiri +3 more
doaj +9 more sources
The Signless Laplacian Estrada Index of Unicyclic Graphs [PDF]
For a simple graph G, the signless Laplacian Estrada index is defined as SLEE(G)=∑ni=1eqi, where q1, q2,..., qn are the eigenvalues of the signless Laplacian matrix of G.
Hamid Reza Ellahi +3 more
doaj +3 more sources
Lower bounds for Estrada index and Laplacian Estrada index
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Gutman
exaly +2 more sources
On the Eigenvalues and Energy of the Seidel and Seidel Laplacian Matrices of Graphs
Let SΓ be a Seidel matrix of a graph Γ of order n and let DΓ=diagn−1−2d1,n−1−2d2,…,n−1−2dn be a diagonal matrix with di denoting the degree of a vertex vi in Γ. The Seidel Laplacian matrix of Γ is defined as SLΓ=DΓ−SΓ.
J. Askari +2 more
doaj +2 more sources

