Jump to ContentJump to Main Navigation
Show Summary Details

Open Mathematics

formerly Central European Journal of Mathematics

Editor-in-Chief: Gianazza, Ugo / Vespri, Vincenzo

1 Issue per year


IMPACT FACTOR 2015: 0.512

SCImago Journal Rank (SJR) 2015: 0.521
Source Normalized Impact per Paper (SNIP) 2015: 1.233
Impact per Publication (IPP) 2015: 0.546

Mathematical Citation Quotient (MCQ) 2015: 0.39

Open Access
Online
ISSN
2391-5455
See all formats and pricing
Volume 14, Issue 1 (Jan 2016)

Issues

On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs

Yilun Shang
  • Corresponding author
  • School of Mathematical Sciences, Tongji University, Shanghai 200092, China
  • Email:
Published Online: 2016-09-15 | DOI: https://doi.org/10.1515/math-2016-0055

Abstract

As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G. In this paper we obtain a closed-form formula for the enumeration of spanning trees in Г(G), employing the theory of electrical networks. We present bounds for the largest and second smallest Laplacian eigenvalues of Г(G) in terms of the maximum degree, the number of edges, and the first Zagreb index of G. In addition, we establish upper and lower bounds for the Laplacian Estrada index of Г(G) based on the vertex degrees of G. These bounds are also connected with the number of spanning trees in Г(G).

Keywords: Laplacian Estrada index; Subdivide-line graph; Line graph; Laplacian spectrum; Spanning tree

MSC 2010: 05C50; 05C76; 05C30; 05C05

1 Introduction

In this paper we are concerned with simple connected (molecular) graphs. Let G be such a graph with the vertex set V(G) = {υ1,…, υn} and the edge set E(G). The adjacency matrix of G is A(G)=(aij)n×n, where aij = 1 if two vertices υi, and υj are adjacent in G and aij = 0 otherwise. The Laplacian matrix of G is the matrix L(G) = D(G) — A(G), where D(G) is a diagonal matrix with dG(υi), dG(υ2),…, dG(υn) on the main diagonal, in which dG(υi) is the degree of the vertex υi, in G. Since L(G) is a positive semi-definite matrix and G is connected, the eigenvalues of L(G) can be ordered as λ1(G)λ2(G)...λn1(G)>λn(G)=0 [1]. They are referred to as the Laplacian eigenvalues of G, and λn-1(G) is also called the algebraic connectivity of G [2]. The line graph of G, written L(G), is the graph whose vertex set is in one-to-one correspondence with the edge set E(G) of G, and whose two vertices are adjacent if and only if the corresponding edges in G have a common vertex. The barycentric subdivision B(G) of G is the graph obtained from G by inserting a vertex to each edge of G. More precisely, V(B(G))=V(G)υe|e=u,υE(G), where, υeV(G), and E(B(G)) = {{u,υe, {υe, υ}|e={u, υ} ∈ E(G). Inspired by self-similar structures of Sierpiński graphs (see, e.g., [[3, 4]), Hasunuma [5] introduced recently the subdivided-line graph operation Г.

Definition 1.1: The subdivided-line graph Г(G) of G is the line graph of the barycentric subdivision of G, namely, Г(G) = L(B(G)).

The subdivided-line graph Г(G), combining both notions of line graph and barycentric subdivision, generalizes the class of Sierpiński-like graphs. Various structural properties, such as edge-disjoint Hamilton cycles, hamiltonian-connectivity, hub sets, connected dominating sets, independent spanning trees, and book-embeddings, have been systematically investigated in [5].

Among numerous graph-theoretic concepts, spanning trees have found a wide range of applications in mathematics, chemistry, physics and computer sciences. Denote by τ(G) the number of spanning trees in G. Enumeration of spanning trees in graphs with certain symmetry and fractals has been widely studied via ad hoc techniques capitalizing on the particular structures [611]. In general, we often have to resort to Kirchhoff’s celebrated matrix-tree theorem [12], which asserts that (G) equals the product of all nonzero eigenvalues of Laplacian matrix of G, i.e., τ(G)=1ni=1n1λi(G). However, numerical computation for large graphs is notoriously difficult since the calculation of eigenvalues is NP-hard with respect to graph size [13]. Our first main result in this paper is an exact formula for enumeration of spanning trees in Г(G). To obtain τ(Г(G)), the idea of electrically equivalent transformations [14] will be applied, which enables us to determine the relationship of the numbers of spanning trees in networks before and after the transformation.

The Laplacian Estrada index of a (molecular) graph G with n vertices is defined as [15] LEE(G)=i=1neλi(G).(1)

It is a close relative of the so-called Estrada index put forward by Estrada [16] in 2000, which has already found extensive applications in chemistry and physics. Many properties of LEE, including upper/lower bounds and extremal graphs, have been established (see e.g. [15, 1720]). Here, to deal with LEE(Г(G)), we first derive bounds for the largest and second smallest eigenvalues λ1(Г(G)) and λ|Г(G))|-1(Г(G)). Based on these estimates and the obtained exact expression for τ(Г(G)), we manage to present upper and lower bounds for LEE(Г(G)) in terms of some basic graph parameters of G, including degrees and the number of edges.

2 Preliminaries

To begin with, we briefly review the electrically equivalent transformation technique introduced in [14].

An edge-weighted graph G (with the weight function ω:E(G)[0,)) can be considered as an electrical network with the weights being the conductances of the corresponding edges. The weighted number of spanning trees in G is defined as σ(G)=TT(G)eE(T)ω(e),(2)

where T(G) denotes the set of spanning trees of G. Evidently, τ(G) = σ(G) if G is a simple graph, namely, ω(e) = 1 for every eE(G). Two edge-weighted graphs G and H are called electrically equivalent with respect to ΘV(G)V(H), if they cannot be distinguished by applying voltages to Θ and measuring the resulting currents on Θ. In [14], Teufl and Wagner showed that if a subgraph of a graph G is replaced by an electrically equivalent graph (setting the resulting graph G′), the weighted number of spanning trees only changes by an explicit factor. The effect of each of the two electrically equivalent transformations that will be used later is described as follows.

– Serial edges transformation: If two serial edges with conductances a and b are merged into a single edge with conductance aba+b, we have σ(G)=1a+bσ(G).

– Mesh-star transformation: If a complete graph Kt (t ≥ 2) with conductance a on all its edges is changed into a star K1, t with conductance ta on all its edges, we have σ(G)=t2aσ(G).

Fig. 1 shows an example of the above electrically equivalent transformations.

The following two lemmas on the Laplacian eigenvalues will be used in our proofs.

Lemma 2.1: ([21]) Let G be a simple graph. Then λ1(G)max{u,υ}E(G){dG(u)+dG(υ)}. If G is connected then the equality holds if and only if G is bipartite semiregular. Here, a semiregular graph G = (V, E) is a graph with bipartition (V1, V2) of V such that all vertices in Vi have the same degree ki for i = 1,2.

Fig. 1

An example of serial edges and mesh-star transformations

Lemma 2.2: ([22]) Let G be a simple connected graph with n ≥ 2 vertices and m edges. Then λn1(G)2mm(n2)(n22mn)n1 with equality if and only if G is a complete graph.To conclude this section, we present an inequality which will be instrumental in bounding LEE(Г(G)) later. It is also interesting in its own right.

Lemma 2.3: Given an integer n ≥ 1 and a sequence a1 ≥ a2 ≥ … ≥ an ≥ 0, we have i=1nain(i=1nai)1n+(n1)(a1an). The equality holds if a1 = … = an.

3 Number of spanning trees related to degree sequence

The main result in this section is the following exact formula for the number of spanning trees in Г(G) in terms of the degree sequence of G.

Theorem 3.1: Let G be a simple connected graph. Then τ(Γ(G))=υV(G)(d(υ)+2)d(υ)d2(υ)TT(G)e=u,υE(T)d(u)d(υ)(d(u)+2)(d(υ)+2e=u,υE(G)E(T)d(u)d(υ)+d(u)+d(υ)(d(u)+2)(d(υ)+2),(3) where T(G) is the set of spanning trees in G, and d(υ) := dG(υ) for short.

Fig. 2

An example of some related operations on a graph G with n = |V(G)| = 5 vertices and m = |E(G)| 5 edges

The electric network technique for enumeration of spanning trees is particular useful when the graph in question has a high degree of symmetry; see e.g. [10] for an application on pseudofractal networks. It is worth noting that we do not assume any symmetry in G.

As a simple example, note that the graph G in Fig. 2 contains four spanning trees. Direct calculation using Theorem 3.1 yields τ(Г(G)) = 23. This is in line with the outcome from the matrix-tree theorem.

4 Bounds for Laplacian eigenvalues

We begin with the following upper bound for the largest Laplacian eigenvalue of a subdivided-line graph.

Theorem 4.1: Let G be a simple connected graph. Then λ1(Γ(G))2Δ(G).(10) where Δ(G) is the maximum degree of G. The equality holds if and only if G is a regular bipartite graph.

with equality if and only if G is regular bipartite.

The first Zagreb index [24] of a graph G is defined as Zg(G)=υV(G)dG2(v). The next result gives us a lower bound for the second smallest eigenvalue of Г(G).

Theorem 4.2: Let G be a simple connected graph with | V(G)| ≥ 2. Then λ|V(Γ(G))|1(Γ(G))Zg(G)Zg(G)(m1)(4m2Zg(G)2m)2m1,(11) where 2m = 2|E(G)| = | V(Г(G))|. The equality holds if and only if G is a single edge.

In [26], Mohar showed that λn1(G)4ndiam(G), where G is a simple connected graph with n vertices and diameter diam(G). Since the line graph can change the diameter only by at most one, up or down [27,28], we obtain, in particular, diam(Γ(G))diam(B(G))+12diam(G)+1.

Hence, λ2m1(Γ(G))2m(2diam(G)+1).

Obviously, the bounds of (11) and (12) are incomparable.

5 Bounds for Laplacian Estrada index

In the light of the matrix-tree theorem which relates the Laplacian eigenvalues to the number of spanning trees, we in this section convert the above obtained results into bounds of the Laplacian Estrada index LEE(Г(G)).

Theorem 5.1: Let G be a simple connected graph with |V(G)| > 2. Then 2m+(2m1)(e(2mτ(Γ(G)))12m11)LEE(Γ(G))(2m1)(e(2mτ(Γ(G)))12m11)+(2m2)(mm+1+eλ1(Γ(G))eλ2m1(Γ(G))),(13) where 2m = 2|E(G)| = |V(Г(G))|. In the first inequality, equality holds if and only if G is a single edge, while the second equality holds if G is a single edge.Furthermore, LEE(Γ(G))(2m1)e2mτ(Γ(G))12m11+(2m2)mm1+e2Δ(G)eZg(G)Zg(G)(m1)(4m2Zg(G)2m2m1(14) with equality if G is a single edge.

To show the availability of Theorem 5.1, we still use the graph G depicted in Fig. 2 as an example. Direct calculation shows LEE(Γ(G))=i=110eλi(Γ(G))=259.7. The respective lower bound and upper bound are 57.1 and 772.1 by Theorem 5.1.

Acknowledgement

The author is grateful to the anonymous reviewers for their helpful comments and suggestions toward improving the original version of the paper. The author acknowledges support from the National Natural Science Foundation of China (11505127), the Shanghai Pujiang Program (15PJ1408300), and the Program for Young Excellent Talents in Tongji University (2014KJ036).

References

  • [1]

    Merris R., Laplacian matrices of graphs: a survey, Lin. Algebra Appl., 1994, 197-198, 143-176

  • [2]

    Fiedler M., Algebraic connectivity of graphs, Czech. Math. J., 1973, 23, 298-305

  • [3]

    Klavžar S., Milutinović U., Graphs S(n, k) and a variant of the tower of Hanoi problem, Czech. Math. J., 1997, 47, 95-104

  • [4]

    Klavžar S., Milutinović U., Petr C., 1-perfect codes in Sierpiński graphs, Bull. Austral. Math. Soc., 2002, 66, 369-384

  • [5]

    Hasunuma T., Structural properties of subdivided-line graphs, J. Discrete Algorithms, 2015, 31, 69-86

  • [6]

    Nikolopoulos S.D., Papadopoulos C., The number of spanning trees in Kn-complements of quasi-threshold graphs, Graphs Combin., 2004, 20, 383-397

  • [7]

    Chung K.L., Yan W.M., On the number of spanning trees of a multi-complete/star related graph, Inform. Process. Lett., 2000, 76, 113-119

  • [8]

    Zhang Z.Z., Wu B., Comellas F., The number of spanning trees in Apollonian networks, Discrete Appl. Math., 2014, 169, 206-213

  • [9]

    Hinz A., Klavžar S., Zemljić S., Sierpiński graphs as spanning subgraphs of Hanoi graphs, Cent. Eur. J. Math., 2013, 11, 1153-1157

  • [10]

    Xiao J., Zhang J., Sun W., Enumeration of spanning trees on generalized pseudofractal networks, Fractals, 2015, 23, 1550021

  • [11]

    Sun W., Wang S., Zhang J., Counting spanning trees in prism and anti-prism graphs, J. Appl. Anal. Comp., 2016, 6, 65-75

  • [12]

    Kirchhoff G., Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird, Ann. Phys. Chem., 1847, 72, 497-508

  • [13]

    Garey M.R., Johnson D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979

  • [14]

    Teufl E., Wagner S., Determinant identities for Laplace matrice, Lin. Algebra Appl., 2010, 432, 441-457

  • [15]

    Fath-Tabar G.H., Ashrafi A.R., Gutman I., Note on Estrada and L-Estrada indices of graphs, Bull. Cl. Sci. Math. Nat. Sci. Math., 2009, 139, 1-16

  • [16]

    Estrada E., Characterization of 3D molecular structure, Chem. Phys. Lett., 2000, 319, 713-718

  • [17]

    Zhou B., Gutman I., More on the Laplacian Estrada index, Appl. Anal. Discrete Math., 2009, 3, 371-378

  • [18]

    Shang Y., Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs, PLoS ONE, 2015, 10, e0123426

  • [19]

    Chen X., Hou Y., Some results on Laplacian Estrada index of graphs, MATCH Commun. Math. Comput. Chem., 2015, 73, 149-162

  • [20]

    Shang Y., Estrada and L-Estrada indices of edge-independent random graphs, Symmetry, 2015, 7, 1455-1462

  • [21]

    Anderson W.N., Morley T.D., Eigenvalues of the Laplacian of a graph, Linear Multilinear Algebra, 1985, 18, 141-145

  • [22]

    Tian G., Huang T., Cui S., Bounds on the algebraic connectivity of graphs, Advances in Mathematics (China), 2012, 41, 217-224

  • [23]

    Gong H., Jin X., A formula for the number of the spanning trees of line graphs, arXiv:1507.063891

  • [24]

    Gutman I., Das K.Ch., The first Zagreb index 30 years after, MATCH Commun. Math. Comput. Chem., 2004, 50, 83-92

  • [25]

    Harary F., Graph Theory, Addison-Wesley, Massachusetts, 1971

  • [26]

    Mohar B., Eigenvalues, diameter, and mean distance in graphs, Graphs Combin., 1991, 7, 53-64

  • [27]

    Hedman B., Clique graphs of time graphs, J. Combin. Th. Ser. B, 1984, 37, 270-278

  • [28]

    Hedman B., Diameters of iterated clique graphs, Hadronic J., 1986, 9, 273-276

About the article

Received: 2016-05-27

Accepted: 2016-08-09

Published Online: 2016-09-15

Published in Print: 2016-01-01


Citation Information: Open Mathematics, ISSN (Online) 2391-5455, DOI: https://doi.org/10.1515/math-2016-0055. Export Citation

© 2016 Shang, published by De Gruyter Open. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. (CC BY-NC-ND 3.0)

Comments (0)

Please log in or register to comment.
Log in