Results 41 to 50 of about 4,479,442 (268)

On the \(c\)-dominating Estrada index of a graph

Online Journal of Analytic Combinatorics, 2021
Let \( G \) be a graph with \( n \) vertices, then the \( c \)-dominating matrix of \( G \) is the square matrix of order \( n \) whose \( (i, j) \)-entry is equal to 1 if the \( i \)-th and \( j \)-th vertex of \( G \) are adjacent, is also equal to 1 ...
A. Jahanbani, H. Shooshtari
semanticscholar   +1 more source

Bounds on the Distance Energy and the Distance Estrada Index of Strongly Quotient Graphs

Journal of Applied Mathematics, 2013
The notion of strongly quotient graph (SQG) was introduced by Adiga et al. (2007). In this paper, we obtain some better results for the distance energy and the distance Estrada index of any connected strongly quotient graph (CSQG) as well as some ...
Ş. Burcu Bozkurt, Chandrashekara Adiga, Durmuş Bozkurt   +2 more
doaj   +1 more source

On Estrada index of trees

Linear Algebra and its Applications, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Jianbin, Zhou, Bo, Li, Jianping
openaire   +1 more source

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, Ramin Nasiri, Gholam Hossein Fath-Tabar, Ahmad Gholami   +3 more
doaj   +1 more source

On the Estrada index conjecture

Linear Algebra and its Applications, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, Kinkar Ch., Lee, Sang-Gu
openaire   +2 more sources

Some Properties on Estrada Index of Folded Hypercubes Networks

Abstract and Applied Analysis, 2014
Let G be a simple graph with n vertices and let λ1,λ2,…,λn be the eigenvalues of its adjacency matrix; the Estrada index EEG of the graph G is defined as the sum of the terms eλi,  i=1,2,…,n.
Jia-Bao Liu, Xiang-Feng Pan, Jinde Cao
doaj   +1 more source

A note on the generalized Gaussian Estrada index and Gaussian subgraph centrality of graphs

AIMS Mathematics
Let $ H $ be a simple, undirected, connected graph represented by its adjacency matrix $ \mathit{\boldsymbol{A}} $. For a vertex $ u \in V(H) $, the generalized Gaussian subgraph centrality of $ u $ in $ H $ is $ GSC (u, \beta) = \exp \left(- \beta ...
Yang Yang, Yanyan Song, Haifeng Fan, Haiyan Qiao   +3 more
semanticscholar   +1 more source

On the Estrada index of cacti

The Electronic Journal of Linear Algebra, 2014
Let G be a simple connected graph on n vertices and λ_1, λ_2, . . . , λ_n be the eigenvalues of the adjacency matrix of G. The Estrada index of G is defined as EE(G) = \sum_{i=1}^n e^{λi}. A cactus is a connected graph in which any two cycles have at most one common vertex.
Erfang Shan, Hongzhuan Wang, Liying Kang
openaire   +1 more source

Maximum signless Laplacian Estrada index of tetracyclic graphs

Filomat
In 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 ?
Palaniyappan Nithya, S. Elumalai, Selvaraj Balachandran, Hechao Liu   +3 more
semanticscholar   +1 more source

Estimating the Estrada index

Linear Algebra and its Applications, 2007
Some inequalities for the Estrada index are obtained. Among them are two-sided vertex-edges estimates. For trees the path has minimum and the star has maximum Estrada index.
de la Peña, José Antonio, Gutman, Ivan, Rada, Juan   +2 more
openaire   +1 more source