Results 31 to 40 of about 4,479,442 (268)
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
Generalization for Estrada Index
AIP Conference Proceedings, 2010 In this paper the Estrada index of Hermite matrix is firstly defined and investigated. In fact this is a natural generalization of Estrada, distance Estrada and Laplacian Estrada indices. Thus all properties about them can be handled by this new index.
A. Dilek Güngör +7 more
openaire +6 more sources
On the Estrada Indices of Unicyclic Graphs with Fixed Diameters
Mathematics, 2021 The Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenvalues of the adjacency matrix of G. A unicyclic graph is a connected graph with a unique cycle.
Wenjie Ning, Kun Wang
doaj +1 more source
A New Like Quantity Based on “Estrada Index”
Journal of Inequalities and Applications, 2010 We first define a new Laplacian spectrum based on Estrada index, namely, Laplacian Estrada-like invariant, LEEL, and two new Estrada index-like quantities, denoted by S and EEX, respectively, that are generalized versions of the Estrada index. After that,
A. Dilek Güngör
doaj +1 more source
On some aspects of the generalized Petersen graph
Electronic Journal of Graph Theory and Applications, 2017 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
A Note on the Estrada Index of the Aα-Matrix
Mathematics, 2021 Let G be a graph on n vertices. The Estrada index of G is an invariant that is calculated from the eigenvalues of the adjacency matrix of a graph. V. Nikiforov studied hybrids of A(G) and D(G) and defined the Aα-matrix for every real α∈[0,1] as: Aα(G)=αD(
Jonnathan Rodríguez, Hans Nina
doaj +1 more source
Lower bounds for Estrada Index [PDF]
Publications de l'Institut Mathematique, 2008 If G is an (n,m)-graph whose spectrum consists of the numbers ?1, ?2, . . . , ?n, then its Estrada index is EE(G) = ?n i=1 e?i . We establish lower bounds for EE(G) in terms of n and m.
openaire +2 more sources
A Few Examples and Counterexamples in Spectral Graph Theory
Discussiones Mathematicae Graph Theory, 2020 We present a small collection of examples and counterexamples for selected problems, mostly in spectral graph theory, that have occupied our minds over a number of years without being completely resolved.
Stevanović Dragan +2 more
doaj +1 more source
On Relationships of Eigenvalue–Based Topological Molecular Descriptors
Acta Chimica Slovenica, 2020 Three eigenvalue-based topological molecular descriptors are compared using several datasets of alkanes. Two of them are well-known and frequently employed in various QSPR/QSAR investigations, and third-one is a newly derived whose predictive potential ...
Izudin Redžepović, Boris Furtula
doaj +1 more source
Bounds on the α-Distance Energy and α-Distance Estrada Index of Graphs
Discrete Dynamics in Nature and Society, 2020 Let G be a simple undirected connected graph, then DαG=αTrG+1−αDG is called the α-distance matrix of G, where α∈0,1, DG is the distance matrix of G, and TrG is the vertex transmission diagonal matrix of G.
Yang Yang, Lizhu Sun, Changjiang Bu
doaj +1 more source