On the Estrada Indices of Unicyclic Graphs with Fixed Diameters

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. Let U(n,d) be the set of all unicyclic graphs with n vertices and diameter d. In this paper, we give some transformations which can be used to compare the Estrada indices of two graphs. Using these transformations, we determine the graphs with the maximum Estrada indices among U(n,d). We characterize two candidate graphs with the maximum Estrada index if d is odd and three candidate graphs with the maximum Estrada index if d is even.

Effect of a Ring onto Values of Eigenvalue–Based Molecular Descriptors

The eigenvalues of the characteristic polynomial of a graph are sensitive to its symmetry-related characteristics. Within this study, we have examined three eigenvalue–based molecular descriptors. These topological molecular descriptors, among others, are gathering information on the symmetry of a molecular graph. Furthermore, they are being ordinarily employed for predicting physico–chemical properties and/or biological activities of molecules. It has been shown that these indices describe well molecular features that are depending on fine structural details. Therefore, revealing the impact of structural details on the values of the eigenvalue–based topological indices should give a hunch how physico–chemical properties depend on them as well. Here, an effect of a ring in a molecule on the values of the graph energy, Estrada index and the resolvent energy of a graph is examined.

On the distance signless Laplacian Estrada index of graphs

The distance signless Laplacian eigenvalues [Formula: see text] of a connected graph [Formula: see text] are the eigenvalues of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix of vertex transmissions of [Formula: see text]. In this paper, we define and investigate the distance signless Laplacian Estrada index of a graph [Formula: see text] as [Formula: see text], and obtain some upper and lower bounds for [Formula: see text] in terms of other graph invariants. We also obtain some relations between [Formula: see text] and the auxiliary distance signless Laplacian energy of [Formula: see text].

A Note on the Estrada Index of the Aα-Matrix

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(G)+(1−α)A(G). In this paper, using a different demonstration technique, we present a way to compare the Estrada index of the Aα-matrix with the Estrada index of the adjacency matrix of the graph G. Furthermore, lower bounds for the Estrada index are established.