Results 11 to 20 of about 150 (120)
Graphs with maximum Laplacian and signless Laplacian Estrada index
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivan Gutman, Maria Robbiano
exaly +2 more sources
The Extremal Structures of r-Uniform Unicyclic Hypergraphs on the Signless Laplacian Estrada Index
Mathematics, 2022 SLEE has various applications in a large variety of problems. The signless Laplacian Estrada index of a hypergraph H is defined as SLEE(H)=∑i=1neλi(Q), where λ1(Q),λ2(Q),…,λn(Q) are the eigenvalues of the signless Laplacian matrix of H. In this paper, we
Hongyan Lu, Zhongxun Zhu
doaj +2 more sources
The Laplacian energy and Laplacian Estrada index of random multipartite graphs
Journal of Mathematical Analysis and Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaogang Liu +2 more
exaly +2 more sources
Mathematics, 2019 Suppose that G is a simple undirected connected graph. Denote by D ( G ) the distance matrix of G and by T r ( G ) the diagonal matrix of the vertex transmissions in G, and let α ∈ [ 0 , 1 ] .
Abdollah Alhevaz +2 more
doaj +3 more sources
On the maximum Laplacian Estrada index of graphs
Linear Algebra and Its Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi Wang
exaly +3 more sources
Characterizing graphs with maximal Laplacian Estrada index
Linear Algebra and Its Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Jianping, Zhang, Jianbin
exaly +3 more sources
Lower bounds for the Estrada index using mixing time and Laplacian spectrum
Rocky Mountain Journal of Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
YILUN Shang
exaly +3 more sources
THE NORMALIZED LAPLACIAN ESTRADA INDEX OF GRAPHS
Journal of Applied Mathematics & Informatics, 2014 Hongbo Hua +2 more
exaly +3 more sources
On Distance Signless Laplacian Estrada Index and Energy of Graphs [PDF]
Kragujevac Journal of Mathematics, 2021 Summary: For a connected graph \(G\), the distance signless Laplacian matrix is defined as \(D^Q(G)=\mathrm{Tr}(G)+D(G)\), where \(D(G)\) is the distance matrix of \(G\) and \(\mathrm{Tr}(G)\) is the diagonal matrix of vertex transmissions of \(G\).
Alhevaz, Abdolla +2 more
openaire +1 more source
Signless Laplacian Estrada index and Laplacian Estrada index of uniform hypergraphs
, 2022 We generalize the notions of Laplacian and signless Laplacian Estrada index to uniform hypergraphs. For an $r$-uniform hypergraph $H,$ we derive an order $r+1$ trace formula of the (signless) Laplacian tensor of $H.$ Among others by using this trace formula, we obtain lower bounds for the signless Laplacian Estrada index and upper bounds for the ...
Duan, Cunxiang +2 more
openaire +2 more sources