Results 1 to 10 of about 51 (41)
The normalized signless laplacian estrada index of graphs [PDF]
Transactions on Combinatorics, 2023 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
On maximum signless Laplacian Estrada index of graphs with given parameters II [PDF]
Electronic Journal of Graph Theory and Applications, 2018 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]
Mathematics Interdisciplinary Research, 2017 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
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
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\).
Maryam Baghipur
exaly +2 more sources
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
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
Sharp bounds on the signless Laplacian Estrada index of graphs
Filomat, 2014 Let G be a connected graph with n vertices and m edges. Let q1, q2,..., qn be the eigenvalues of the signless Laplacian matrix of G, where q1 ? q2 ? ... ? qn. The signless Laplacian Estrada index of G is defined as SLEE(G) = nPi=1 eqi. In this paper, we present some sharp lower bounds for SLEE(G) in terms of the k-degree and the first ...
Huiqing Liu, Liu Huiqing
exaly +3 more sources
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
A Note on Some Bounds of the α‐Estrada Index of Graphs
Advances in Mathematical Physics, Volume 2020, Issue 1, 2020., 2020 Let G be a simple graph with n vertices. Let A~αG=αDG+1−αAG, where 0 ≤ α ≤ 1 and A(G) and D(G) denote the adjacency matrix and degree matrix of G, respectively. EEαG=∑i=1neλi is called the α‐Estrada index of G, where λ1, ⋯, λn denote the eigenvalues of A~αG. In this paper, the upper and lower bounds for EEα(G) are given.
Yang Yang +3 more
wiley +1 more source