Journal ArticleDOI
Distance Estrada index of random graphs
TLDR
In this paper, lower and upper bounds for the distance Estrada index of a simple graph were established for almost all graphs, and the eigenvalues of its distance matrix were derived.Abstract:
Suppose is a simple graph and are the eigenvalues of its distance matrix . The distance Estrada index of is defined as the sum of , . In this paper, we establish better lower and upper bounds to for almost all graphs .read more
Citations
More filters
Proceedings ArticleDOI
Random graphs
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Journal ArticleDOI
Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.
TL;DR: It is found that neither the static snapshot graphs nor the aggregated graph can approximate the evolving graph itself, indicating the fundamental difference between the static and dynamic Estrada indices.
Journal ArticleDOI
On the Generalized Distance Energy of Graphs
TL;DR: In this article, the generalized distance matrix of a simple connected graph G is defined as a convex combination of the convex combinations of T r (G ) + (1 − α ) D (G) for 0 ≤ α ≤ 1.
Journal ArticleDOI
Classification of renewable sources of electricity in the context of sustainable development of the new EU member states
TL;DR: In this article, the authors employed hierarchical cluster analysis in an attempt to distinguish those countries among the new EU Member States that increased their electrical capacity from renewable energy sources to the greatest extent while paying attention to their energy intensity.
Journal ArticleDOI
Merging the Spectral Theories of Distance Estrada and Distance Signless Laplacian Estrada Indices of Graphs
TL;DR: In this paper, the generalized distance Estrada index of a graph G is defined as a generalized distance matrix D α (G ) = ∑ i = 1 n e ∂ i − 2 α W ( G ) n, where W denotes the Wiener index of G.
References
More filters
Lower bounds for the estrada index of graphs
TL;DR: In this paper, new lower bounds for the Estrada index were established, and the EStrada index of G is defined as EE(G) = Pn = 1 ei.
Journal ArticleDOI
Estrada index of general weighted graphs
TL;DR: In this article, the Estrada index of a general weighted graph is defined as a graph invariant defined in terms of low-order spectral moments, and lower and upper bounds for the weights of closed walks are established.
Posted Content
Bounds of distance Estrada index of graphs
TL;DR: New lower and upper bounds for the distance Estrada index of G are presented and a Nordhaus-Gaddum type inequality for $DEE(G)$ is given.