The Scientific World Journal

Volume 2014 (2014), Article ID 294038, 5 pages

http://dx.doi.org/10.1155/2014/294038

Research Article

On the Number of Spanning Trees of Graphs

Ş. Burcu Bozkurt and Durmuş Bozkurt

Department of Mathematics, Science Faculty, Selçuk University, Alaeddin Keykubat Campus, 42075 Konya, Turkey

Received 29 August 2013; Accepted 24 December 2013; Published 10 February 2014

Academic Editors: C. D. Fonseca and A. Jaballah

Copyright © 2014 Ş. Burcu Bozkurt and Durmuş Bozkurt. 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.

Abstract.

We establish some bounds for the number of spanning trees of connected graphs in terms of the number of vertices , the number of edges , maximum vertex degree , minimum vertex degree , …first Zagreb index and Randić index .

1. Introduction

Let be a simple connected graph with vertices and edges. Let be the vertex set and the edge set of . If any two vertices and of are adjacent, that is, , then we use the notation . For , the degree of the vertex , denoted by , is the number of the vertices adjacent to . Let , , and be the maximum, the second maximum, and the minimum vertex degree of , respectively.

Let be the first Zagreb index [1] and the general Randić index [2] of the graph , where is a fixed real number. Note that the Randić index is also well studied in the literature. For more details on , see [3, 4].

Let , , and denote the complete graph, the complete bipartite graph, and the star graph of order , respectively. Let be the graph obtained by deleting the edge from the graph and let be the complement of . Let be the vertex-disjoint union of the graphs and . The graph is obtained from by adding all possible edges from vertices of to vertices of ; that is, [5].

The Laplacian matrix of the graph is the matrix , where and are the -adjacency matrix and the diagonal matrix of the vertex degrees of , respectively. The normalized Laplacian matrix of is defined as , where is the matrix which is obtained by taking power of each entry of . The Laplacian eigenvalues and the normalized Laplacian eigenvalues of are the eigenvalues of and , respectively. Let be the Laplacian eigenvalues and the normalized Laplacian eigenvalues of . Note that , , and the multiplicities of these zero eigenvalues are equal to the number of connected components of ; see [6, 7]. For more details on Laplacian and normalized Laplacian eigenvalues, see [6, 8–10].

The number of spanning trees, , of the graph is equal to the total number of distinct spanning subgraphs of that are trees. This quantity is also known as the complexity of and given by the following formula in terms of the Laplacian eigenvalues [5]:

It is well known that the number of spanning trees of is also expressed by the normalized Laplacian eigenvalues as [5, 6]

Now, we give some known upper bounds on :

(1)Grimmett [11]:

(2)Grone and Merris [12]:

(3)Nosal [13]: for -regular graphs,

(4)Cvetković et al. (see [5, page 222]):

where is the number of edges of ,(5)Das [14]:

(6)Zhang [15]:

where ,(7)Feng et al. [16]:

(8)Li et al. [17]:

(9)Bozkurt [18]:

where ,(10)Das et al. [19]:

In [11] Grimmet points out that (3) generalizes (5). Grone and Merris [12] observed that, by the application of arithmetic-geometric mean inequality, (4) leads to (3). Das [14] stated that (7) is sharp for or , but (3), (4), (5), and (6) are sharp for only . In [17] Li et al. indicated that (11) is sharp for , , or , but (3) is sharp for only and (7) and (9) are sharp for or . However, Das et al. [19] proved that (11) is not true for . In [15, 16, 18] the authors showed that (8) is better than (3), (9) is better than (7) and (10), and (12) is better than (4). For more bounds and the relations between the number of spanning trees and the structural parameters of graphs such as connectivity, chromatic number, independence number, and clique number, see [17, 19].

We organize this paper in the following way. In Section 2, we give some previously known results which will be needed later. In Section 3, we obtain some bounds for the number of spanning trees of connected graphs in terms of the number of vertices , the number of edges , maximum vertex degree , minimum vertex degree , first Zagreb index , and Randić index . We also showed that some of our results on connected bipartite graphs improve the bounds (9) and (10) for these graphs.

2. Lemmas

In this section, we give some useful lemmas which will be used later. Firstly, we introduce an auxiliary quantity for a graph as

where and are the maximum and the minimum vertex degree of , respectively.

The result in the following lemma is also known as Kober’s inequality.

Lemma 1 (see [20]). Let be nonnegative numbers and let

be their arithmetic and geometric means, respectively. Then

Moreover, equality in (16) holds if and only if .

Lemma 2 (see [21]). Let be a graph with vertices and normalized Laplacian matrix without isolated vertices. Then

Lemma 3 (see [8]). Let be a graph with vertices and without isolated vertices. Then if and only if is a complete graph .

Lemma 4 (see [8]). Let be a connected graph with vertices. Then if and only if or .

Note that, the Laplacian eigenvalues of a bipartite graph coincide with its signless Laplacian eigenvalues, that is, eigenvalues of the signless Laplacian matrix [9, 10, 22]. Thus, one can arrive at the following result.

Lemma 5 (see [23, 24]). Let be a connected bipartite graph with vertices and let be the maximum vertex degree of . Then

with either equalities if and only if is a star graph .

Lemma 6 (see [9]). Let be a graph with vertices. Then , with equality if and only if is disconnected.

Lemma 7 (see [14]). Let be a connected graph with vertices. Then if and only if or or .

3. Main Results

Recently, Das et al. [19] established upper and lower bounds on applying Kober’s inequality to Laplacian eigenvalues of a connected graph . We now consider Kober’s inequality for the normalized Laplacian eigenvalues of in order to present some bounds on .

Theorem 8. Let be a connected graph with vertices, edges, and Randić index . Then

Moreover, equalities in (19) and (20) hold if and only if .

Proof. Taking , , and in Lemma 1, we get

By the proof of Theorem 7 in [19] and Lemma 2, we have

Then, combining (21) with this and (2), we get

This implies that

Hence we obtain the first part of the theorem. Now we suppose that the equalities in (19) and (20) hold. Then, by Lemma 1, we have . Therefore, from Lemma 3, we get that .

Conversely, we can easily see that the equalities in (19) and (20) hold for the complete graph .

We now consider the above theorem for connected bipartite graphs.

Theorem 9. Let be a connected bipartite graph with vertices, edges, and Randić index . Then

Moreover, equalities in (25) hold if and only if .

Proof. Taking , , and in Lemma 1, we have

Since is bipartite, we also have [6]. Then, by Lemma 2, we get

Therefore, combining (26) with this and (2), we arrive at

This implies that

Hence we get the inequalities (25). Now we suppose that the equalities in (25) hold. Then, by Lemma 1, we have . Therefore, by Lemma 4, we conclude that .

Conversely, we can easily see that the equalities in (25) hold for the complete bipartite graph .

We now present the improvement of the results obtained in [16] for bipartite graphs.

Theorem 10. Let be a connected bipartite graph with vertices and edges and let be given by (14). Then

with equality if and only if .

Proof. From (1) and Lemmas 5–7, one can prove (30) in a similar way to the proof of Theorem 1.1 in [16].

Remark 11. From Lemma 5, we have . Then by the proof of Theorem 1.1 in [16], one may conclude that (30) improves (9) for bipartite graphs.

Theorem 12. Let be a connected bipartite graph with vertices, edges, and first Zagreb index and let be given by (14). Then

with equality if and only if .

Proof. From (1) and Lemmas 5–7, the proof of (31) can be easily given in a similar way to the proof of Theorem 1.2 in [16].

Remark 13. From Lemma 5, we have . Then by the proof of Theorem 1.2 in [16], one may conclude that (31) improves (10) for bipartite graphs.

Remark 14. By using the similar manner in [16], one can easily show that (30) is better than (31). Moreover, if we can obtain a new bound , then we can improve the bounds (30) and (31).

Example 15. Let be a graph with vertex set and edge set

For this graph, is equal to . At rounded three decimal places, the bounds (8), (9), (11), (12), (13), and (19) give , , , , , , , and , respectively. This shows that the bound (19) is the best among the mentioned upper bounds for . But in general sense, they are not comparable.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

The authors are partially supported by TUBITAK and the Office of Selçuk University Research Project (BAP).

References

I. Gutman and K. Ch. Das, “The first Zagreb index 30 years after,” MATCH Communications in Mathematical and in Computer Chemistry, no. 50, pp. 83–92, 2004.

B. Bollobás and P. Erdös, “Graphs of extremal weights,” Ars Combinatoria, vol. 50, pp. 225–233, 1998.

M. Cavers, S. Fallat, and S. Kirkland, “On the normalized Laplacian energy and general Randić index of graphs,” Linear Algebra and Its Applications, vol. 433, no. 1, pp. 172–190, 2010.

G. Yu and L. Feng, “Randić index and eigenvalues of graphs,” Rocky Mountain Journal of Mathematics, vol. 40, no. 2, pp. 713–721, 2010.

D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs, vol. 87 of Pure and Applied Mathematics, Academic Press, New York, NY, USA, 1980.

F. R. K. Chung, Spectral Graph Theory, CBMS Lecture Notes, AMS, Providence, RI, USA, 1997.

M. Fiedler, “Algebraic connectivity of graphs,” Czechoslovak Mathematical Journal, vol. 23, no. 98, pp. 298–305, 1973.

K. Ch. Das, A. D. Güngör, and Ş. B. Bozkurt, “On the normalized Laplacian eigenvalues of graphs,” Ars Combinatoria. In press

R. Merris, “Laplacian matrices of graphs: a survey,” Linear Algebra and Its Applications, vol. 197-198, pp. 143–176, 1994.

R. Merris, “A survey of graph Laplacians,” Linear and Multilinear Algebra, vol. 39, no. 1-2, pp. 19–31, 1995.

G. R. Grimmett, “An upper bound for the number of spanning trees of a graph,” Discrete Mathematics, vol. 16, no. 4, pp. 323–324, 1976.

R. Grone and R. Merris, “A bound for the complexity of a simple graph,” Discrete Mathematics, vol. 69, no. 1, pp. 97–99, 1988.

E. Nosal, Eigenvalues of graphs [M.S. thesis], University of Calgary, 1970.

K. Ch. Das, “A sharp upper bound for the number of spanning trees of a graph,” Graphs and Combinatorics, vol. 23, no. 6, pp. 625–632, 2007.

X.-D. Zhang, “A new bound for the complexity of a graph,” Utilitas Mathematica, vol. 67, pp. 201–203, 2005.

L. Feng, G. Yu, Z. Jiang, and L. Ren, “Sharp upper bounds for the number of spanning trees of a graph,” Applicable Analysis and Discrete Mathematics, vol. 2, no. 2, pp. 255–259, 2008.

J. Li, W. C. Shiu, and A. Chang, “The number of spanning trees of a graph,” Applied Mathematics Letters, vol. 23, no. 3, pp. 286–290, 2010.

Ş. B. Bozkurt, “Upper bounds for the number of spanning trees of graphs,” Journal of Inequalities and Applications, vol. 2012, article 269, 7 pages, 2012.

K. Ch. Das, A. S. Cevik, and I. N. Cangul, “The number of spanning trees of a graph,” Journal of Inequalities and Applications, vol. 2013, article 395, 13 pages, 2013.

H. Kober, “On the arithmetic and geometric means and on Hölder's inequality,” Proceedings of the American Mathematical Society, vol. 9, pp. 452–459, 1958.

P. Zumstein, Comparison of spectral methods through the adjacency matrix and the Laplacian of a graph [Diploma thesis], ETH Zürich, 2005.

D. Cvetković, P. Rowlinson, and S. K. Simić, “Signless Laplacians of finite graphs,” Linear Algebra and Its Applications, vol. 423, no. 1, pp. 155–171, 2007.

Y. Chen and L. Wang, “Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph,” Linear Algebra and Its Applications, vol. 433, no. 5, pp. 908–913, 2010.

Y. Zhang, X. Liu, B. Zhang, and X. Yong, “The lollipop graph is determined by its -spectrum,” Discrete Mathematics, vol. 309, no. 10, pp. 3364–3369, 2009.