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
Journal ArticleDOI
The Distance Laplacian Spectral Radius of Clique Trees
Xiaoling Zhang,Jiajia Zhou +1 more
TL;DR: In this article, the maximum and minimum distance Laplacian spectral radius among all clique trees with vertices and cliques was determined among all trees with cliques and vertices.
Journal Article
Estimating the distance Estrada index
TL;DR: In this article, the distance Estrada index of a simple graph on n vertices is defined as the sum of the eigenvalues of the distance matrix of the graph.
Journal ArticleDOI
More on the normalized laplacian estrada index
TL;DR: In this paper, a tight lower bound for the normalized Laplacian Estrada index (NEE) of general graphs is given for treelike bipartite graphs with T fractal and Peano basin basin fractal.
Journal ArticleDOI
On the spectrum of linear dependence graph of a finite dimensional vector space
Sushobhan Maity,A. K. Bhuniya +1 more
TL;DR: The main contribution of this article is to find eigen values of adjacency matrix, Laplacian matrix and distance matrix of this graph, which is Eulerian if and only if q is odd.
Journal ArticleDOI
The many facets of the Estrada indices of graphs and networks
TL;DR: The Estrada index of a graph/network is defined as the trace of the adjacency matrix exponential and has been extended to other graph-theoretic matrices, such as the Laplacian, distance, Seidel adjacencies, Harary, etc as mentioned in this paper.
References
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.
Book
Spectra of graphs : theory and application
TL;DR: The Spectrum and the Group of Automorphisms as discussed by the authors have been used extensively in Graph Spectra Techniques in Graph Theory and Combinatory Applications in Chemistry an Physics. But they have not yet been applied to Graph Spectral Biblgraphy.