scholar.google.com › citations
The Estrada index of a simple connected graph G of order n is defined as EE(G) =∑i=1neλi, where λ1,λ2,…,λn are the eigenvalues of the adjacency matrix of G.
All tetracyclic graphs of order n with maximal Estrada index are characterized. The Estrada index of a simple connected graph G of order n is defined as ...
May 22, 2017 · The Estrada index of a simple connected graph G of order n is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λn are the eigenvalues of the ...
Tetracyclic graphs with maximal Estrada index. Authors. Rad, Nader Jafari ... In this paper, we characterize all tetracyclic graphs of order with maximal Estrada ...
In this paper, we consider the Estrada index of tetracyclic graphs, and characterize all tetracyclic graphs of order n with maximal Estrada index. The ...
The Estrada index of a simple connected graph GG of order nn is defined as EE(G)=∑ni=1eλiEE(G)=∑i=1neλi, where λ1,λ2,…,λnλ1,λ2,…,λn are the eigenvalues of the ...
The graphs with the maximal Estrada indices in Ψ n , m are deduced by the new method for three cases, namely unicyclic and bipartite unicyclic graphs ( m = n ), ...
Missing: Tetracyclic | Show results with:Tetracyclic
Tetracyclic graphs with maximal Estrada index · N. J. RadA. JahanbaniD. Mojdeh. Mathematics. Discret. Math. Algorithms Appl. 2017. TLDR. All tetracyclic graphs ...
The graphs with the maximal Estrada indices in Ψn,mΨn,m are deduced by the new method for three cases, namely unicyclic and bipartite unicyclic graphs (m=nm=n), ...
Missing: Tetracyclic | Show results with:Tetracyclic
Jan 10, 2014 · Let be the class of tricyclic graphs on vertices. In this paper, the graphs in with the maximal Estrada index is characterized.
Missing: Tetracyclic | Show results with:Tetracyclic