- Research Article
- Open Access

# A New Like Quantity Based on "Estrada Index"

- A Dilek Güngör
^{1}Email author

**2010**:904196

https://doi.org/10.1155/2010/904196

© A. Dilek Güngör. 2010

**Received:**12 February 2010**Accepted:**16 March 2010**Published:**26 April 2010

## Abstract

We first define a new Laplacian spectrum based on Estrada index, namely, *Laplacian Estrada-like invariant, LEEL*, and two new *Estrada index-like quantities*, denoted by *S* and
, respectively, that are generalized versions of the Estrada index. After that, we obtain some lower and upper bounds for *LEEL*, *S*, and
.

## Keywords

- Direct Calculation
- Adjacency Matrix
- Connected Graph
- Symmetric Matrice
- Laplacian Matrix

## 1. Introduction and Preliminaries

It is known that, for an -graph (i.e., an undirected graph with no loops and multiple edges), the numbers of vertices and edges of are denoted by and , respectively. Throughout this paper, all graphs will be concerned as an -graph.

Let be the adjacency matrix of , and let be its eigenvalues. By [1], it is known that these eigenvalues form the spectrum of the graph . Let be connected graph on the vertex set . Then the distance matrix of is defined as its -entry is equal to , denoted by , the distance (in other words, the length of the shortest path) between the vertices and of . Let the eigenvalues of be . Moreover let be the Laplacian matrix of (formally it is denoted by ), and let be its eigenvalues. These eigenvalues form the Laplacian spectrum of the graph (see [2–4]). Since , , and are real symmetric matrices, their eigenvalues are real numbers and so we can order them as , , and . These eigenvalues are shortly called -eigenvalues, -eigenvalues, and -eigenvalues, respectively. The fundamental properties of graph eigenvalues can be found in the study in [1].

The Estrada index has an important role in Chemistry, since it is a proposed molecular structure descriptor, used in the modeling of certain features of the 3D structure of organic molecules, in particular of the degree of folding of proteins and other long-chain biopolymers. There exists a vast literature that studies Estrada index. For example, in [9] it has been examined Estrada index in the case of benzenoid hydrocarbons with a fixed number of carbon atoms and a fixed number of carbon-carbon bonds. Also, in [10], Gutman et al. determined its relation with the spectral radius (i.e., the greatest graph eigenvalue). In addition to Estrada's and Gutman's papers depicted above, we may also refer the reader [11–17] for more detail investigation about this special index and its lower and upper bounds, and some inequalities between and the energy of some graph . Recently, there have been found two new papers [18, 19] that are concerned with the bounds of distance Estrada index and Harary Estrada index of the graph , respectively.

where are the -eigenvalues. (We should note that, since one of the -eigenvalues is necessarily equal to zero, is chosen as zero).

*Laplacian Estrada-like invariant*, denoted by . In fact it is defined as

where each of is defined as in .

For a well understanding of the definition and properties of , and of the dependence of it with the graph structure, in this paper, we mainly establish lower and upper bounds for in terms of , , and . Moreover we also present Nordhaus-Gaddum-type bounds for . Finally, by considering an arbitrary quantity defined from the graph , we also generalize some of the known results on lower and upper bounds that are obtained previously (see [12, 17, 18]) and our results that will be given in the second section.

## 2. Bounds for Laplacian Estrada-Like Invariant in terms of Laplacian Energy-Like Invariant

As a new derivation for obtaining bounds in indexes, we will at first determine some lower and upper bounds for Laplacian Estrada-like invariant, . So the following theorem is the first main result of this section.

Theorem 2.1.

Moreover equality holds in (2.1) if and only if .

Proof.

The Lower Bound

monotonically decreases in the interval . As a result, the best lower bound for is attained for . This gives us the validity of the left-hand side of the inequality in (2.1).

The Upper Bound

as required by the right-hand side of the inequality in (2.1).

Let us consider again inequality given in (2.1). For this, it is easy to check that equality will be held if and only if the graph has no nonzero eigenvalues. Actually this situation can happen only in the case of the edgeless graph , that is, in the case of .

Hence the result is mentioned.

In the following, we will determine two upper bounds for Laplacian Estrada like invariant, , in terms of Laplacian energy-like invariant, .

Theorem 2.2.

Equality holds for both (2.9) and (2.10) if and only if .

Proof.

as required in (2.9). In fact this inequality holds for all -graphs. Additionally, a similar thought as in the proof of Theorem 2.1 gives that equality is attained in (2.9) if and only if .

as claimed in (2.10).

As in the other upper bound case defined in (2.9), equality also occurs in (2.10) if and only if .

In [26], it has been given bounds for the sum of the chromatic numbers of a graph and its complement . After that, in general meanings, so many people investigated a number of graph invariants in terms of and , and collected these studies in the literature under the name of "Nordhaus-Gaddum-type results". For example, in a recent paper [24], Gutman et al. have studied the Nordhaus-Gaddum-type results and then they transferred the Nordhaus-Gaddum-type results for graph energy (which was obtained in [27]) into Nordhaus-Gaddum-type results for Laplacian energy-like invariant, .

In the following we will give a theorem that considers Nordhaus-Gaddum-type results for Laplacian Estrada energy like, .

Theorem 2.3.

Proof.

The Lower Bound

The Upper Bound

Hence the result is attained.

### 2.1. Laplacian Estrada-Like Invariant is Estrada Like

As depicted in [24], starting with the work of McClelland (in [28]), the basic results over bounds for graph energy could be deduced by relying to a limited number of simple properties of the graph eigenvalues (see, for instance, [29]).

Actually, from (2.20) and (2.21), it is possible to deduce both lower and upper bounds for as in the following.

What now needs to be observed is that if we choose , , and (for ), then the auxiliary quantity will be turned out to the Estrada index, as defined in (1.1). Now, all of the two conditions (2.20) and (2.21) are obeyed for the choice , , and (where ), in which case the quantity will be thought as , as defined in (1.6).

Keeping the above in mind, in other words, if all of the two conditions (2.20) and (2.21) are taken into account, then, as a generalization, we have the following three results for similar to results for (given in the previous section) and results for Estrada index deduced previously by some other authors (see [12, 17, 18]):

(1) ,

(2) ,

(3) .

In detail, the following are considered.

(i)If we take , , and (where ), then results presented in ( ), ( ), and ( ) correspond to the bounds ( ), ( ), and ( ) in [12], respectively.

(ii)If we take , , and (where ), then results presented in ( ), ( ), and ( ) correspond to the bounds ( ), ( ), and ( ) in [18], respectively.

(iii)If we take , , and (where ), then results presented in ( ), ( ), and ( ) correspond to the bounds ( ), ( ), and ( ) in [17], respectively.

(iv)If we take , , and (where ), then results presented in ( ), ( ), and ( ) correspond to the bounds obtained in this paper in Theorems 2.1 and 2.2.

## 3. On the Estrada Index-Like Quantity

where
are any real numbers, and
is their arithmetic mean. As depicted in the same paper, if
are the eigenvalues of the adjacency, Laplacian, or distance matrix of some graph
, then *graph energy, Laplacian energy,* and *distance energy* are the special cases of
. (We note that, in [19, Theorem
], as another special case of
, it has been recently shown a lower bound and an upper bound for the Harary energy).

*Estrada index-like quantity*can be defined as

where are arbitrary real numbers, and is their arithmetic mean. In particular, as similarly in , if are the eigenvalues of the adjacency, Laplacian, or distance matrix of some of , then is the Estrada index (see [5, 8, 14, 15]), Laplacian Estrada index (see [17]), or distance Estrada index (see [18]), respectively, of some graph .

By considering (3.2), (3.3), and (3.6), one can show the following results as proved in Theorems 2.1 and 2.2.

Theorem 3.1.

Equality holds if and only if .

Theorem 3.2.

In Theorem 3.2, equality holds in both inequalities if and only if (or, equivalently, ), as given in the proof of Theorem 3.1.

## Authors’ Affiliations

## References

- Cvetkovic DM, Doob M, Sachs H:
*Spectra of Graphs. Theory and Application, Pure and Applied Mathematics*.*Volume 87*. Academic Press, New York, NY, USA; 1980:368.MATHGoogle Scholar - Merris R: Laplacian matrices of graphs: a survey.
*Linear Algebra and Its Applications*1994, 197–198: 143–176.MathSciNetView ArticleMATHGoogle Scholar - Merris R: A survey of graph Laplacians.
*Linear and Multilinear Algebra*1995, 39(1–2):19–31. 10.1080/03081089508818377MathSciNetView ArticleMATHGoogle Scholar - Trinajstić N, Babić D, Nikolić S, Plavšić D, Amić D, Mihalić Z: The Laplacian matrix in chemistry.
*Journal of Chemical Information and Computer Sciences*1994, 34(2):368–376. 10.1021/ci00018a023Google Scholar - Estrada E: Characterization of 3D molecular structure.
*Chemical Physics Letters*2000, 319(5–6):713–718. 10.1016/S0009-2614(00)00158-5View ArticleGoogle Scholar - Estrada E: Characterization of the folding degree of proteins.
*Bioinformatics*2002, 18(5):697–704. 10.1093/bioinformatics/18.5.697View ArticleGoogle Scholar - Estrada E: Characterization of the amino acid contribution to the folding degree of proteins.
*Proteins*2004, 54(4):727–737. 10.1002/prot.10609View ArticleGoogle Scholar - Estrada E, Rodríguez-Velázquez JA, Randić M: Atomic branching in molecules.
*International Journal of Quantum Chemistry*2006, 106(4):823–832. 10.1002/qua.20850View ArticleGoogle Scholar - Gutman I, Radenković S: Estrada index of benzenoid hydrocarbons.
*Zeitschrift fur Naturforschung*2007, 62(5–6):254–258.Google Scholar - Gutman I, Radenković S, Furtula B, Mansour T, Schork M: Relating Estrada index with spectral radius.
*Journal of the Serbian Chemical Society*2007, 72(12):1321–1327. 10.2298/JSC0712321GView ArticleGoogle Scholar - Das KCh, Lee S-G: On the Estrada index conjecture.
*Linear Algebra and Its Applications*2009, 431(8):1351–1359. 10.1016/j.laa.2009.05.007MathSciNetView ArticleMATHGoogle Scholar - de la Peña JA, Gutman I, Rada J: Estimating the Estrada index.
*Linear Algebra and Its Applications*2007, 427(1):70–76. 10.1016/j.laa.2007.06.020MathSciNetView ArticleMATHGoogle Scholar - Deng H, Radenković S, Gutman I: The Estrada index. In
*Applications of Graph Spectra*. Edited by: Cvetković D, Gutman I. Mathematics Institute, Belgrade, Serbia; 2009:123–140.Google Scholar - Estrada E, Rodríguez-Velázquez JA: Subgraph centrality in complex networks.
*Physical Review E*2005, 71(5):-9.View ArticleMathSciNetGoogle Scholar - Estrada E, Rodríguez-Velázquez JA: Spectral measures of bipartivity in complex networks.
*Physical Review E*2005, 72(4):-6.View ArticleMathSciNetGoogle Scholar - Gutman I: Lower bounds for Estrada index.
*Publications de l'Institut Mathematique*2008, 83(97):1–7. 10.2298/PIM0897001GView ArticleMATHMathSciNetGoogle Scholar - Li J, Shiu WC, Chang A: On the Laplacian Estrada index of a graph.
*Applicable Analysis and Discrete Mathematics*2009, 3(1):147–156. 10.2298/AADM0901147LMathSciNetView ArticleMATHGoogle Scholar - Güngör AD, Bozkurt ŞB: On the distance Estrada index of graphs.
*Hacettepe Journal of Mathematics and Statistics*2009, 38(3):277–283.MathSciNetMATHGoogle Scholar - Güngör AD, Çevik AS: On the Harary energy and Harary Estrada index of a graph.
*MATCH Communications in Mathematical and in Computer Chemistry*2010, 64(1):281–296.MathSciNetMATHGoogle Scholar - Gutman I: The energy of a graph.
*Berichte Forschungszentrum. Mathematisch-Statistische Sektion Forschungsz Graz*1978, 10(103):1–22.MATHMathSciNetGoogle Scholar - Gutman I: The energy of a graph: old and new results. In
*Algebraic Combinatorics and Applications*. Edited by: Betten A, Kohnert A, Laue R, Wassermann A. Springer, Berlin, Germany; 2001:196–211.View ArticleGoogle Scholar - Gutman I, Zhou B: Laplacian energy of a graph.
*Linear Algebra and Its Applications*2006, 414(1):29–37. 10.1016/j.laa.2005.09.008MathSciNetView ArticleMATHGoogle Scholar - Zhou B, Gutman I: On Laplacian energy of graphs.
*MATCH Communications in Mathematical and in Computer Chemistry*2007, 57(1):211–220.MathSciNetMATHGoogle Scholar - Gutman I, Zhou B, Furtula B: The Laplacian-energy like invariant is an energy like invariant.
*MATCH Communications in Mathematical and in Computer Chemistry*2010, 64(1):85–96.MathSciNetMATHGoogle Scholar - Liu J, Liu B: A Laplacian-energy like invariant of a graph.
*MATCH Communications in Mathematical and in Computer Chemistry*2009, 62(3):553–560.MathSciNetGoogle Scholar - Nordhaus EA, Gaddum JW: On complementary graphs.
*American Mathematical Monthly*1956, 63: 175–177. 10.2307/2306658MathSciNetView ArticleMATHGoogle Scholar - Zhou B, Gutman I: Nordhaus-Gaddum-type relations for the energy and Laplacian energy of graphs. Bulletin. Classe de Sciences, Mathématiques et Naturelles. Sciences Mathématiques 2007, (32):1–11.Google Scholar
- McClelland BJ: Properties of the latent roots of a matrix: the estimation of -electron energies.
*Journal of Chemical Physics*1971, 54(2):640–643. 10.1063/1.1674889View ArticleGoogle Scholar - Gutman I, Polansky OE:
*Mathematical Concepts in Organic Chemistry*. Springer, Berlin, Germany; 1986:x+212.View ArticleMATHGoogle Scholar - Gutman I, Indulal G, Todeschini R: Generalizing the McClelland bounds for total -electron energy.
*Zeitschrift fur Naturforschung*2008, 63(5–6):280–282.Google Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.