Home Mathematics Some improved bounds on two energy-like invariants of some derived graphs
Article Open Access

Some improved bounds on two energy-like invariants of some derived graphs

  • Shu-Yu Cui EMAIL logo and Gui-Xian Tian EMAIL logo
Published/Copyright: August 8, 2019

Abstract

Given a simple graph G, its Laplacian-energy-like invariant LEL(G) and incidence energy IE(G) are the sum of square root of its all Laplacian eigenvalues and signless Laplacian eigenvalues, respectively. This paper obtains some improved bounds on LEL and IE of the 𝓡-graph and 𝓠-graph for a regular graph. Theoretical analysis indicates that these results improve some known results. In addition, some new lower bounds on LEL and IE of the line graph of a semiregular graph are also given.

MSC 2010: 05C05; 05C12; 05C50

1 Introduction

We only consider finite simple graphs in this paper. Given a graph G = (V, E) with vertex set V = {v1, v2, …, vn} and edge set E, then di = dG(vi) denotes the degree of vi. If di = r for any i = 1, 2, …, n, then G is called r-regular. If G is a bipartite graph and V = V1V2 is its bipartition, then G is said to (r1, r2)-semiregular whenever each vertex in V1 has degree r1 and each vertex in V2 has degree r2. The adjacency matrix of G, denoted by A(G), is a square matrix whose (i, j)-entry is one if vi and vj are adjacent in G and zero otherwise. Let D(G) be the degree diagonal matrix of G with diagonal entries d1, d2, …, dn. Then L(G) = D(G) − A(G) is called Laplacian matrix of G and Q(G) = D(G) + A(G) is called its signless Laplacian matrix.

Let F be an n × n matrix associated to G. Then its characteristic polynomial ψ(F; x) = det(xInF) is called the F-polynomial of G, where In is the identity matrix of order n. The zeros of ψ(F; x) is said to the F-eigenvalues of G. The set of all F-eigenvalues is called the F-spectrum of G. Specifically, if F is one of the Laplacian matrix L(G) and signless Laplacian matrix Q(G) of G, then the corresponding spectrum are called respective L-spectrum and Q-spectrum. Throughout we denote the respective L-spectrum and Q-spectrum by Sp(L(G)) = {μ1, μ2, …, μn} and Sp(Q(G)) = {q1, q2, …, qn}, where μ1μ2 ≥ ⋯ ≥ μn = 0 and q1q2 ≥ ⋯ ≥ qn ≥ 0 are the eigenvalues of L(G) and Q(G), respectively. For more details about L-spectrum and Q-spectrum of G, readers may refer to [1, 2, 3, 4, 5, 6].

For the L-spectrum of G, Liu and Liu [7] put forward the concept of the Laplacian-energy-like invariant, that is,

LEL(G)=i=1n1μi. (1)

The motivation of this concept derived from the Laplacian energy [8], along with graph energy [9]. Recently, Stevanović et al. [10] pointed out that LEL has become a newly molecular descriptor. For more details about the mathematical properties of LEL, readers may refer to [11, 12, 13, 14, 15, 16, 17] and the references therein.

In 2007, Nikiforov also extended the definition of graph energy to any matrix M [18]. The energy of M is defined to the sum of all singular values of M, denoted by E(M). Motivated further by above concepts E(M) and LEL, Jooyandeh et al. [19] gave the definition of incidence energy IE(G) = E(B(G)) of a graph G, where B(G) is the incidence matrix of G. It is easy to see that

IE(G)=E(B(G))=i=1nqi. (2)

For more details about IE, see [19, 20, 21, 22] and the references therein.

Regular graphs and semi-regular graphs are two important graph classes in graph theory and combinatorics, which play an important role in the study of spectral theory of graphs. In recent years, LEL and IE of some operations on regular graphs and semi-regular graphs have attracted people’s attention. For example, some sharp bounds about LEL are obtained by Wang and Luo [15] for the line graph, subdivision graph and total graph of regular graphs. Pirzada et al. [23] also presented some new bounds about LEL for the line graph of semiregular graphs, the para-line graph, 𝓡-graph, 𝓠-graph of regular graphs. In addition, Gutman et al. [21] presented some sharp bounds for IE of the line graph and iterated line graph of regular graphs. Wang et al. [24] gave some new bounds for IE of the subdivision graph and total graph of regular graphs. Wang and Yang [25] also presented some upper bounds on IE for the line graph of semiregular graphs, the para-line graph of a regular graph. Recently, Chen et al. [26] obtained some new bounds for LEL and IE of the line graph, subdivision graph and total graph of regular graphs. They pointed out that these results improved some known bounds in [15, 21].

Motivated by above researches, this paper gives some new bounds for LEL of the 𝓡-graph, 𝓠-graph of regular graphs. Theoretical analysis indicates that these results improve some known results obtained by Pirzada et al. in [23]. We also obtain some new bounds for IE of the 𝓡-graph, 𝓠-graph of regular graphs. These results are a useful supplement for the existing results on some bounds of LEL and IE of related graph operations of regular graphs in [26]. In addition, some new lower bounds are also presented on LEL and IE for the line graph of semiregular graphs.

2 Preliminaries

Some definitions of line graphs, 𝓡-graph and 𝓠-graph are recalled in this section and some lemmas are listed, which shall be used in the following sections.

Recall that the line graph 𝓛(G) [2] of G is the graph whose vertex set is the edge set of G, and two vertices in 𝓛(G) are adjacent if and only if the corresponding edges in G have exactly a common vertex. Given an (r1, r2)-semiregular graph G of order n with m edges, then the L-spectrum [23] and Q-spectrum [25] of 𝓛(G) are, respectively,

Sp(L(L(G)))=(r1+r2)(mn),r1+r2μ1,,r1+r2μn (3)

and

Sp(Q(L(G)))=(r1+r24)(mn),r1+r24+q1,,r1+r24+qn, (4)

where a(b) indicates that a is repeated b times, {μ1, μ2, …, μn} and {q1, q2, …, qn} are the L-spectrum and Q-spectrum of G, respectively.

The 𝓡-graph [2] of G, denoted by 𝓡(G), is the graph derived from G by adding a vertex wi corresponding to every edge ei = uv of G and by connecting every vertex wi to the end vertices u and v of ei. If G is an r-regular graph of order n with m edges, then L-polynomial [27, 28] and Q-polynomial [29] of 𝓡(G) are, respectively,

ψ(L(R(G)),x)=x(x2)mn(xr2)i=1n1[(x2)(xrμi)2r+μi] (5)

and

ψ(Q(R(G)),x)=(x2)mn(x2(2+3r)x+4r)i=2n[(x2)(xrqi)qi]. (6)

From (5) and (6), we obtain the following lemma easily.

Lemma 2.1

[27, 29] If G is an r-regular graph of order n with m edges, then

  1. If the L-spectrum of G is Sp(L(G)) = {μ1 …, μn}, then the L-spectrum of 𝓡(G)

    Sp(L(R(G)))=2(mn),(r+2+μi)±(r+2+μi)212μi2(i=1,2,,n).
  2. If the Q-spectrum of G is Sp(Q(G)) = {q1, …, qn}, then the Q-spectrum of 𝓡(G)

    Sp(Q(R(G)))=2(mn),(r+2+qi)±(r+2+qi)24(2r+qi)2(i=1,2,,n).

    The 𝓠-graph [2] of G, denoted by 𝓠(G), is the graph derived from G by plugging a vertex wi to every edge ei = uv of G and by adding a new edge between two new vertices whenever these new vertices lie on adjacent edges of G. If G is an r-regular graph of order n with m edges, then L-polynomial [27, 28] and Q-polynomial [29] of 𝓠(G) are, respectively,

    ψ(L(Q(G)),x)=x(x2r2)mn(xr2)i=1n1[(xr)(x2μi)2r+μi] (7)

    and

    ψ(Q(Q(G)),x)=(x2r+2)mn[(xr)(x4r+2)2r]i=2n[(xr)(x2r+2qi)qi]. (8)

    Similarly, from (7) and (8), one obtains the following lemma easily.

Lemma 2.2

[27, 29] If G is an r-regular graph of order n with m edges, then

  1. If the L-spectrum of G is Sp(L(G)) = {μ1, …, μn}, then the L-spectrum of 𝓠(G)

    Sp(L(Q(G)))=(2r+2)(mn),(r+2+μi)±(r+2+μi)24μi(r+1)2(i=1,2,,n).
  2. If the Q-spectrum of G is Sp(Q(G)) = {q1, …, qn}, then the Q-spectrum of 𝓠(G)

    Sp(Q(Q(G)))=(2r2)(mn),(3r2+qi)±(3r2+qi)24r(2r2+qi)+4qi2,

    where i = 1, …, n.

Lemma 2.3

[26] If G is an r-regular graph of order n, then

nrr+1LEL(G)r+1+(n2)(nrr1),

where both equalities hold if and only if G is the complete graph Kn.

Lemma 2.4

[30] If G is any graph of order n, with at least one edge, then μ1 = μ2 = ⋯ = μn−1 if and only if G is the complete graph Kn.

The following lemma for Q-spectrum is analogous to above Lemma 2.4 for L-spectrum. By Theorem 3.6 in [1], one obtains the following lemma easily.

Lemma 2.5

If G is a graph of order n, with at least one edge, then q2 = q3 = ⋯ = qn if and only if G is the complete graph Kn.

The following lemma comes from [31], which is called the Ozeki’s inequality.

Lemma 2.6

[31] Let ξ = (a1, …, an) and η = (b1, …, bn) be two positive n-tuples with 0 < paiP and 0 < qbiQ, where i = 1, …, n. Then

i=1nai2i=1nbi2i=1naibi214n2(PQpq)2. (9)

It is a remarkable fact that a refinement of Ozeki’s inequality was obtained by Izumino et al.[32] below.

Lemma 2.7

[32] Let ξ = (a1, …, an) and η = (b1, …, bn) be two n-tuples with 0 ≤ paiP, 0 ≤ qbiQ and PQ ≠ 0, where i = 1, …, n. Take α = p/P and β = q/Q. If (1 + α)(1 + β) ≥ 2, then (9) still holds.

Remark that if G is 1-regular, then G is isomorphic to n2 K2. For avoiding the triviality, we always suppose that r ≥ 2 for an r-regular graph. For an (r1, r2)-semiregular graph G, G is isomorphic to n3 P3 whenever r1+r2 = 3. Next we also suppose that r1+r2 ≥ 4 for an (r1, r2)-semiregular graph throughout this paper. In addition, it is well known [2, 3] that the largest Laplacian eigenvalue μ1 ≤ 2r and largest signless Laplacian eigenvalue q1 = 2r for an r-regular graph. From Lemma 3.3 in [23], we also see that μ1 = r1+r2 for an (r1, r2)-semiregular graph.

3 The Laplacian-energy-like invariant

In this section, we shall give some improved bounds for LEL of 𝓡-graph and 𝓠-graph of regular graphs, as well as for the line graph of semiregular graphs. Now we first consider LEL of 𝓡-graph of regular graphs.

Theorem 3.1

If G is an r-regular graph of order n with m edges, then

  1. LEL(R(G))n(r2)22+r+2+(n1)r+2+nrn1+23n1LEL(G), (10)

    where the equality holds in (10) if and only if G is the complete graph Kn.

  2. LEL(R(G))n(r2)22+r+2+(n1)34(r+2)+nrn1+23n1LEL(G). (11)

Proof

Suppose that Sp(L(G)) = {μ1, μ2, …, μn} is the L-spectrum of G. Then from (1) and the (i) in Lemma 2.1, one gets

LEL(R(G))=i=1n1(r+2+μi)+(r+2+μi)212μi2+i=1n1(r+2+μi)(r+2+μi)212μi2+(mn)2+r+2=i=1n1(r+2+μi)+(r+2+μi)212μi2+(r+2+μi)(r+2+μi)212μi22+(mn)2+r+2=i=1n1r+2+μi+23μi+(mn)2+r+2. (12)

Notice that i=1n1 μi = 2m = nr. Applying the Cauchy-Schwarz inequality, one obtains

LEL(R(G))(n1)i=1n1(r+2+μi+23μi)+(mn)2+r+2=(n1)r+2+nrn1+23n1LEL(G)+n(r2)22+r+2,

where above equality holds if and only if μ1 = μ2 = ⋯ = μn−1. It follows from Lemma 2.4 that G is the complete graph Kn. Hence the proof of the (i) is completed.

Now we prove the (ii). Assume that ai=r+2+μi+23μi and bi = 1, i = 1, …, n − 1. Take P = 3r+2+26r,p=r+2 and Q = q = 1. Since 0 ≤ μi ≤ 2r, then 0 < paiP, 0 < qbiQ and

(PQpq)2=(3r+2+26rr+2)2=(3r+2r+2)2r+2.

By Lemma 2.6, we obtain

i=1n1r+2+μi+23μi(n1)i=1n1(r+2+μi+23μi)14(n1)2(PQpq)2(n1)34(r+2)+nrn1+23n1LEL(G).

From (12), one obtains the required result (ii).□

Corollary 3.2

If G is an r-regular graph of order n with m edges, then

  1. LEL(R(G))n(r2)22+r+2+(n1)r+2+nrn1+23(r+1+(n2)(nrr1))n1,

    where above equality holds if and only if G is the complete graph Kn.

  2. LEL(R(G))>n(r2)22+r+2+(n1)34(r+2)+nrn1+23n1nrr+1.

Proof

Theorem 3.1 (i) and Lemma 2.3 together imply (i) in the corollary. Again, from Lemma 2.3 and (11), one gets

LEL(R(G))n(r2)22+r+2+(n1)34(r+2)+nrn1+23n1nrr+1. (13)

Suppose that the equality in (13) holds. From Lemma 2.3, we have G is the complete graph Kn. But for the complete graph Kn, the inequality (10) implies that the equality is false in (11). This completes the proof.□

Remark 1

Given an r-regular graph G of order n, Pirzada et al. [23] proved that

n(r2)22+nr+2<LEL(R(G))n(r2)22+r+2+(n1)(3r+2), (14)

where the equality on the right of (14) holds if and only if G is the complete graph K2. Notice that these bounds in Corollary 3.2 improve those in (14). In fact, by direct computation, we have

r+2+nrn1+23(r+1+(n2)(nrr1))n1r+2+nrn1+23(n1)nrn1=r+2+nrn1+23nrn1r+2+2r+232r=3r+2,

which implies that the upper bound in Corollary 3.2 is an improvement on that in (14). For the lower bound, it is easy to see that

34(r+2)+nrn1+23n1nrr+1>34(r+2)+r>r+2.

Hence the lower bound in Corollary 3.2 is also an improvement on that in (14).

Next we consider the Laplacian-energy-like invariant of 𝓠-graph of a regular graph.

Theorem 3.3

If G is an r-regular graph of order n with m edges, then

  1. LEL(Q(G))n(r2)22r+2+r+2+(n1)r+2+nrn1+2r+1n1LEL(G), (15)

    where the equality holds in (15) if and only if G is the complete graph Kn.

  2. LEL(Q(G))>n(r2)22r+2+r+2+(n1)r+2+nrn1+2r+1n1LEL(G)34r. (16)

Proof

Assume that Sp(L(G)) = {μ1, …, μn} is L-spectrum of G. By the (i) in Lemma 2.2 and (1), one has

LEL(Q(G))=i=1n1(r+2+μi)+(r+2+μi)24(r+1)μi2+i=1n1(r+2+μi)(r+2+μi)24(r+1)μi2+(mn)2r+2+r+2=i=1n1(r+2+μi)+(r+2+μi)24(r+1)μi2+(r+2+μi)(r+2+μi)24(r+1)μi22+(mn)2r+2+r+2=i=1n1r+2+μi+2(r+1)μi+(mn)2r+2+r+2. (17)

Notice that i=1n1 μi = 2m = nr. Applying the Cauchy-Schwarz inequality, one obtains

LEL(Q(G))(n1)i=1n1(r+2+μi+2(r+1)μi)+(mn)2r+2+r+2=(n1)r+2+nrn1+2r+1n1LEL(G)+n(r2)22r+2+r+2

with the equality holding if and only if μ1 = μ2 = ⋯ = μn−1. By Lemma 2.4, G is the complete graph Kn. The proof of the (i) is completed.

Next we prove the (ii). Assume that ai=r+2+μi+2(r+1)μi and bi = 1, where i = 1, …, n − 1. Take P=3r+2+22r(r+1),p=r+2 and Q = q = 1. Since 0 ≤ μi ≤ 2r and P=3r+2+22r(r+1)7r+2. Then 0 < paiP, 0 < qbiQ and

(PQpq)2=(3r+2+22r(r+1)r+2)2(7r+2r+2)2<3r.

From (17) and Lemma 2.6, one has

i=1n1r+2+μi+2(r+1)μi(n1)i=1n1(r+2+μi+2(r+1)μi)14(n1)2(PQpq)2>(n1)r+2+nrn1+2r+1n1LEL(G)34r.

From (17), one obtains the required result (ii).□

By Theorem 3.3, we obtain Corollary 3.4 immediately.

Corollary 3.4

If G is an r-regular graph of order n with m edges, then

  1. LEL(Q(G))(n1)r+2+nrn1+2r+1(r+1+(n2)(nrr1))n1+n(r2)22r+2+r+2,

    where the equality holds if and only if G is the complete graph Kn.

  2. LEL(Q(G))>n(r2)22r+2+r+2+(n1)(3nn1+14)r+2.

Remark 2

Given an r-regular graph G, Pirzada et al. [23] proved that

n(r2)22r+2+nr+2<LEL(Q(G))(n1)r+r+2+(nr2)2r+22, (18)

where the equality on the right of (18) holds if and only if G is the complete graph K2. Since (3nn1+14)r>r, then the lower bound in Corollary 3.4 is an improvement on that in (18). For the upper bound, one has

r+2+nrn1+2r+1(r+1+(n2)(nrr1))n1r+2+nrn1+2r+1(n1)nrn1=r+2+nrn1+2r+1nrn1<r+2+2r+2r+12r=2r+2+r.

Hence, the upper bound in Corollary 3.4 is also an improvement on that in (18).

We finally consider the LEL of line graph of an (r1, r2)-semiregular graph. Pirzada et al. [23] presented the following an upper bound on LEL of line graph 𝓛(G) for an (r1, r2)-semiregular graph G, that is,

LEL(L(G))(nr1r2r1+r2n+1)r1+r2+(n2)n1n2(r1+r2)2nr1r1(n2)(r1+r2).

Next we shall give a lower bound on LEL of its line graph 𝓛(G).

Theorem 3.5

If G is an (r1, r2)-semiregular graph of order n with m edges, then

LEL(L(G))(nr1r2r1+r2n+1)r1+r2+(n2)3n24n8(r1+r2)2nr1r2(n2)(r1+r2).

Proof

Suppose that Sp(L(G)) = {μ1, …, μn} is the L-spectrum of G. Since μ1 = r1 + r2 and μn = 0, then from (1) and (3), one gets

LEL(L(G))=(mn+1)r1+r2+i=2n1r1+r2μi.

Now, assume that ai=r1+r2μi and bi = 1, i = 2, …, n − 1. Take P=r1+r2, p = 0 and Q = q = 1. Obviously, 0 ≤ paiP, 0 ≤ qbiQ, PQ ≠ 0 and (1 + p/P)(1 + q/Q) ≥ 2. From Lemma 2.7, we have

LEL(L(G))(mn+1)r1+r2+(n2)i=2n1(r1+r2μi)14(n2)2(r1+r2)=(mn+1)r1+r2+(n2)r1+r22m(r1+r2)n214(r1+r2)=(mn+1)r1+r2+(n2)3n24n8(r1+r2)2mn2,

which yields the required result as m = nr1r2/(r1+r2).□

4 The incidence energy

In this section, we shall give some new bounds for IE of 𝓡-graph and 𝓠-graph of regular graphs, as well as for the line graph of semiregular graphs. Now we first consider IE of 𝓡-graph of regular graphs.

Theorem 4.1

If G is an r-regular graph of order n with m edges, then

  1. IE(R(G))n(r2)22+3r+2+4r+(n1)2n3n1r+23n4n1r+2, (19)

    where the equality holds if and only if G is the complete graph Kn.

  2. IE(R(G))>n(r2)22+3r+2+4r+(n1)(2n3n1232)r+2(3n4n13222)r+2. (20)

Proof

Assume that Sp(Q(G)) = {q1, …, qn} is the Q-spectrum of G. Notice that q1 = 2r as G is r-regular. Then from (2) and the (ii) in Lemma 2.1, we obtain, by a simple calculation,

IE(R(G))=i=2nr+qi+2+22r+qi+(mn)2+3r+2+4r. (21)

Clearly, i=2n qi = 2m − 2r = (n − 2)r. Applying the Cauchy-Schwarz inequality, one obtains

i=2nr+2+qi+22r+qi(n1)i=2n(r+2+qi+22r+qi)=(n1)2n3n1r+2+2n1i=2n2r+qi(n1)2n3n1r+2+2n1(n1)i=2n(2r+qi)=(n1)2n3n1r+2+23n4n1r.

From (21), we obtain the desired upper bound (19). Moreover, above equality occurs if and only if q1 = 2r and q2 = q3 = ⋯ = qn. Thus by Lemma 2.5, G is the complete graph Kn. The proof of the (i) is completed.

Next we prove the (ii). Assume that ai=r+2+qi+22r+qi and bi = 1, i = 2, …, n. Take P = 3r+2+4r,p=r+2+22r and q = Q = 1. Since 0 ≤ qi ≤ 2r, then 0 < paiP, 0 < qbiQ. By a simple computation, one has

(PQpq)2=3r+2+4rr+2+22r2<(423)r.

Then by Lemma 2.6, one has

i=2nr+2+qi+22r+qi(n1)i=2n(r+2+qi+22r+qi)14(n1)2(PQpq)2>(n1)(2n3)rn1+2+2n1i=2n2r+qi14(423)r.

Similarly, assume that ai=2r+qi and bi = 1, i = 2, …, n. Take P=2r,p=2r and Q = q = 1. Since 0 ≤ qi ≤ 2r, then 0 < paiP, 0 < qbiQ. Again by Lemma 2.6, one has

i=2n2r+qi(n1)i=2n(2r+qi)14(n1)2(2r2r)2=(n1)(3n4n13222)r.

Hence,

i=2nr+2+qi+22r+qi>(n1)(2n3n1232)r+2(3n4n13222)r+2,

which, along with (21), implies the required result (ii).□

Next we shall consider IE of 𝓠-graph for regular graphs.

Theorem 4.2

If G is an r-regular graph of order n with m edges, then

  1. IE(Q(G))n(r2)22r+2+5r2+4r(r1)+(n1)4n5n1r+23n4n1r(r1)2, (22)

    where the equality holds in (22) if and only if G is the complete graph Kn.

  2. IE(Q(G))>n(r2)22r+2+5r2+4r(r1)+(n1)(4n5n114)r+2(3n4n13222)r(r1)2. (23)

Proof

Assume that Sp(Q(G)) = {q1, …, qn} is the Q-spectrum of G. Notice that q1 = 2r as G is r-regular. Then from (2) and the (ii) in Lemma 2.2, it is easy to see that, by a simple calculation,

IE(Q(G))=i=2n3r+qi2+2r(2r+qi2)qi+(mn)2r2+5r2+4r(r1). (24)

Clearly, i=2n qi = 2m − 2r = (n − 2)r. Applying the Cauchy-Schwarz inequality, one obtains

i=2n3r+qi2+2r(2r2+qi)qi(n1)i=2n(3r+qi2+2r(2r2+qi)qi)=(n1)4n5n1r2+2n1i=2nr(2r2+qi)qi(n1)4n5n1r2+2n1(n1)i=2n[r(2r2+qi)qi]=(n1)4n5n1r2+23n4n1r(r1),

which, along with (24), implies the desired upper bound. Moreover, above equality occurs if and only if q1 = 2r and q2 = q3 = ⋯ = qn. Thus from Lemma 2.5, G is the complete graph Kn. The proof of the (i) is completed.

Now we prove the (ii). Assume that ai=3r2+qi+2r(2r2+qi)qi and bi = 1, where i = 2, …, n. Take P=5r2+4r(r1),p=3r2+22r(r1) and Q = q = 1. Since 0 ≤ qi ≤ 2r, then 0 < paiP, 0 < qbiQ. By a simple computation, one has

(PQpq)2=(5r2+4r(r+1)3r2+22r(r1))2<r.

Then by Lemma 2.6, one has

i=2n3r2+qi+2r(2r2+qi)qi(n1)i=2n(3r2+qi+2r(2r2+qi)qi)14(n1)2(PQpq)2>(n1)i=2n(3r2+qi+2r(2r2+qi)qi)14(n1)2r=(n1)(4n5n114)r2+2n1i=2nr(2r2+qi)qi.

Similarly, suppose that ai=r(2r2+qi)qi and bi = 1, i = 2, 3, …, n. Take P=2r(r1),p=2r(r1) and Q = q = 1. Since 0 ≤ qi ≤ 2r, then 0 < paiP, 0 < qbiQ. Again, from Lemma 2.6, one obtains

i=2nr(2r2+qi)qi(n1)i=2n[r(2r2+qi)qi]14(n1)2(PQpq)2=(n1)2r(r1)+n2n1r(r1)14(22)2r(r1)=(n1)(3n4n13222)r(r1).

Hence,

i=2n3r2+qi+2r(2r2+qi)qi>(n1)(4n5n114)r+2(3n4n13222)r(r1)2.

It follows from (24) that the (ii) holds.□

We finally consider the incidence energy of line graph for an (r1, r2)-semiregular graph. In [25], an upper bound on IE of line graph 𝓛(G) for an (r1, r2)-semiregular graph G was obtained as follows:

IE(L(G))(nr1r2r1+r2n+1)r1+r24+2(r1+r2)4+(n2)n3n2(r1+r2)+2nr1r2(n2)(r1+r2)4.

Below one gives a lower bound for IE of its line graph 𝓛(G).

Theorem 4.3

If G is an (r1, r2)-semiregular graph with n vertices and m edges, then

IE(L(G))(nr1r2r1+r2n+1)r1+r24+2(r1+r2)4+(n2)3n104n8(r1+r2)+2nr1r2(n2)(r1+r2)4.

Proof

Suppose that Sp(Q(G)) = {q1, …, qn} is the Q-spectrum of G. Notice that q1 = r1 + r2 and qn = 0 as G is bipartite. Then from (2) and (4)), one gets

IE(L(G))=(mn+1)r1+r24+2(r1+r2)4+i=2n1r1+r24+qi. (25)

Now, assume that ai=r1+r24+qi and bi = 1, i = 2, …, n − 1. Take P=2(r1+r2)4,p=r1+r24 and Q = q = 1. Obviously, 0 ≤ paiP, 0 ≤ qbiQ, PQ ≠ 0 and (1 + p/P)(1 + q/Q) ≥ 2. By a simple computation, one has

(PQpq)2=(2(r1+r2)4r1+r24)2r1+r2.

From Lemma 2.7, one has

i=2n1r1+r24+qi(n2)i=2n1(r1+r24+qi)14(n2)2(r1+r2)=(n2)r1+r24+2m(r1+r2)n214(r1+r2)=(n2)3n104n8(r1+r2)+2mn24,

which, along with (25), implies the required result as m = nr1r2/(r1 + r2).□

Acknowledgements

We would like to thank the anonymous referees for careful reading of our manuscript and for invaluable comments. We are also very grateful to the managing editor for the editing and typesetting work thoughtfully for this paper. This work was supported by the National Natural Science Foundation of China (11801521).

References

[1] Cvetković D., New theorems for signless Laplacians eigenvalues, Bull. Acad. Serbe Sci. Arts, Cl. Sci. Math. Natur., Sci. Math., 2008, 137(33), 131-146.Search in Google Scholar

[2] Cvetković D., Doob M., Sachs H., Spectra of Graphs: Theory and Application, 1980, New York: Academic press.Search in Google Scholar

[3] Cvetković D., Rowinson P., Simić H., An introduction to the Theory of Graph Spectra, 2010, Cambridge: Cambridge University Press.10.1017/CBO9780511801518Search in Google Scholar

[4] Cvetković D., Rowlinson P., Simić S.K., Signless Laplacians of finite graphs, Linear Algebra Appl., 2007, 423, 155-171.10.1016/j.laa.2007.01.009Search in Google Scholar

[5] Grone R., Merris R., Sunder V.S., The Laplacian spectrum of a graph, SIAM J. Matrix Anal. Appl., 1990, 11, 218-238.10.1137/0611016Search in Google Scholar

[6] Merris R., Laplacian matrices of graphs: a survey, Linear Algebra Appl., 1994, 197-198, 143-176.10.1016/0024-3795(94)90486-3Search in Google Scholar

[7] Liu J., Liu B., A Laplacian-energy-like invariant of a graph, MATCH Commun. Math. Comput. Chem., 2008, 59, 397-419.Search in Google Scholar

[8] Gutman I., Zhou B., Laplacian energy of a graph, Linear Algebra Appl., 2006, 414, 29-37.10.1016/j.laa.2005.09.008Search in Google Scholar

[9] Li X., Shi Y., Gutman I., Graph Energy, 2012, New York: Springer.10.1007/978-1-4614-4220-2Search in Google Scholar

[10] Stevanović D., Ilić A., Onisor C., Diudea M., LEL-a newly designed molecular descriptor, Acta Chim. Slov., 2009, 56, 410-417.Search in Google Scholar

[11] Das K.C., Gutman I., Çevik A.S., On the Laplacian-energy-like invariant, Linear Algebra Appl., 2014, 442, 58-68.10.1016/j.laa.2013.05.002Search in Google Scholar

[12] Gutman I., Zhou B., Furtula B., The Laplacian-energy-like invariant is an energy like invariant, MATCH Commun. Math. Comput. Chem., 2010, 64, 85-96.Search in Google Scholar

[13] Liu B., Huang Y., You Z., A survey on the Laplacian-energy-like invariant, MATCH Commun. Math. Comput. Chem., 2011, 66, 713-730.Search in Google Scholar

[14] Liu J.B., Pan X.F., Hu F.T., Hu F.F., Asymptotic Laplacian-energy-like invariant of lattices, Appl. Math. Comput., 2015, 253, 205-214.10.1016/j.amc.2014.12.035Search in Google Scholar

[15] Wang W., Luo Y., On Laplacian-energy-like invariant of a graph, Linear Algebra Appl., 2012, 437, 713-721.10.1016/j.laa.2012.03.004Search in Google Scholar

[16] Xu K., Das K.C., Extremal Laplacian-energy-like invariant of graphs with given matching number, Electron J. Linear Algebra, 2013, 26, 131-140.10.13001/1081-3810.1644Search in Google Scholar

[17] Zhu B.X., The Laplacian-energy like of graphs, Appl. Math. Lett., 2011, 24, 1604-1607.10.1016/j.aml.2011.04.010Search in Google Scholar

[18] Nikiforov V., The energy of graphs and matrices, J. Math. Anal. Appl., 2007, 326, 1472-1475.10.1016/j.jmaa.2006.03.072Search in Google Scholar

[19] Jooyandeh M.R., Kiani D., Mirzakhah M., Incidence energy of a graph, MATCH Commun. Math. Comput. Chem., 2009, 62, 561-572.Search in Google Scholar

[20] Gutman I., Kiani D., Mirzakhah M., On incidence energy of graphs, MATCH Commun. Math. Comput. Chem., 2009, 62, 573-580.10.1016/j.laa.2009.04.019Search in Google Scholar

[21] Gutman I., Kiani D., Mirzakhah M., Zhou B., On incidence energy of a graph, Linear Algebra Appl., 2009, 431, 1223-1233.10.1016/j.laa.2009.04.019Search in Google Scholar

[22] Zhou B., More upper bounds for the incidence energy, MATCH Commun. Math. Comput. Chem., 2010, 64, 123-128.Search in Google Scholar

[23] Pirzada S., Ganie H.A., Gutman I., On Laplacian-energy-like invariant and Kirchhoff index, MATCH Commun. Math. Comput. Chem., 2015, 73, 41-59.10.13001/1081-3810.2961Search in Google Scholar

[24] Wang W., Luo Y., Gao X., On incidence energy of some graphs, Ars Combin., 2014, 114, 427-436.Search in Google Scholar

[25] Wang W., Yang D., Bounds for incidence energy of some graphs, J. Appl. Math., 2013, article ID 757542.10.1155/2013/757542Search in Google Scholar

[26] Chen X., Hou Y., Li J., On two energy-like invariants of line graphs and related graph operations, J. Inequal. Appl., 2016, 51, 1-15.10.1186/s13660-016-0996-1Search in Google Scholar

[27] Deng A., Kelmans A., Meng J., Laplacian spectra of regular graph transformations, Discrete Appl. Math., 2013, 161, 118-133.10.1016/j.dam.2012.08.020Search in Google Scholar

[28] Wang W., Yang D., Luo Y., The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs, Discrete Appl. Math., 2013, 161, 3063-3071.10.1016/j.dam.2013.06.010Search in Google Scholar

[29] Li J., Zhou B., Signless Laplacian characteristic polynomials of regular graph transformations, 2013, arXiv: 1303.5527v1.Search in Google Scholar

[30] Das K.C., A sharp upper bound for the number of spanning trees of a graph, Graphs Comb., 2007, 23, 625-632.10.1007/s00373-007-0758-4Search in Google Scholar

[31] Ozeki N., On the estimation of the inequalities by the maximum, or minimum values, J. College Arts Sci. Chiba Univ., 1968, 5, 199-203.Search in Google Scholar

[32] Izumino S., Mori H., Seo Y., On Ozeki’s inequality, J. Inequal. Appl., 1998, 2, 235-253.10.1155/S1025583498000149Search in Google Scholar

Received: 2018-08-16
Accepted: 2019-06-10
Published Online: 2019-08-08

© 2019 Cui and Tian, published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 Public License.

Articles in the same Issue

  1. Regular Articles
  2. On the Gevrey ultradifferentiability of weak solutions of an abstract evolution equation with a scalar type spectral operator of orders less than one
  3. Centralizers of automorphisms permuting free generators
  4. Extreme points and support points of conformal mappings
  5. Arithmetical properties of double Möbius-Bernoulli numbers
  6. The product of quasi-ideal refined generalised quasi-adequate transversals
  7. Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem
  8. Augmented, free and tensor generalized digroups
  9. Time-dependent attractor of wave equations with nonlinear damping and linear memory
  10. A new smoothing method for solving nonlinear complementarity problems
  11. Almost periodic solution of a discrete competitive system with delays and feedback controls
  12. On a problem of Hasse and Ramachandra
  13. Hopf bifurcation and stability in a Beddington-DeAngelis predator-prey model with stage structure for predator and time delay incorporating prey refuge
  14. A note on the formulas for the Drazin inverse of the sum of two matrices
  15. Completeness theorem for probability models with finitely many valued measure
  16. Periodic solution for ϕ-Laplacian neutral differential equation
  17. Asymptotic orbital shadowing property for diffeomorphisms
  18. Modular equations of a continued fraction of order six
  19. Solutions with concentration and cavitation to the Riemann problem for the isentropic relativistic Euler system for the extended Chaplygin gas
  20. Stability Problems and Analytical Integration for the Clebsch’s System
  21. Topological Indices of Para-line Graphs of V-Phenylenic Nanostructures
  22. On split Lie color triple systems
  23. Triangular Surface Patch Based on Bivariate Meyer-König-Zeller Operator
  24. Generators for maximal subgroups of Conway group Co1
  25. Positivity preserving operator splitting nonstandard finite difference methods for SEIR reaction diffusion model
  26. Characterizations of Convex spaces and Anti-matroids via Derived Operators
  27. On Partitions and Arf Semigroups
  28. Arithmetic properties for Andrews’ (48,6)- and (48,18)-singular overpartitions
  29. A concise proof to the spectral and nuclear norm bounds through tensor partitions
  30. A categorical approach to abstract convex spaces and interval spaces
  31. Dynamics of two-species delayed competitive stage-structured model described by differential-difference equations
  32. Parity results for broken 11-diamond partitions
  33. A new fourth power mean of two-term exponential sums
  34. The new operations on complete ideals
  35. Soft covering based rough graphs and corresponding decision making
  36. Complete convergence for arrays of ratios of order statistics
  37. Sufficient and necessary conditions of convergence for ρ͠ mixing random variables
  38. Attractors of dynamical systems in locally compact spaces
  39. Random attractors for stochastic retarded strongly damped wave equations with additive noise on bounded domains
  40. Statistical approximation properties of λ-Bernstein operators based on q-integers
  41. An investigation of fractional Bagley-Torvik equation
  42. Pentavalent arc-transitive Cayley graphs on Frobenius groups with soluble vertex stabilizer
  43. On the hybrid power mean of two kind different trigonometric sums
  44. Embedding of Supplementary Results in Strong EMT Valuations and Strength
  45. On Diophantine approximation by unlike powers of primes
  46. A General Version of the Nullstellensatz for Arbitrary Fields
  47. A new representation of α-openness, α-continuity, α-irresoluteness, and α-compactness in L-fuzzy pretopological spaces
  48. Random Polygons and Estimations of π
  49. The optimal pebbling of spindle graphs
  50. MBJ-neutrosophic ideals of BCK/BCI-algebras
  51. A note on the structure of a finite group G having a subgroup H maximal in 〈H, Hg
  52. A fuzzy multi-objective linear programming with interval-typed triangular fuzzy numbers
  53. Variational-like inequalities for n-dimensional fuzzy-vector-valued functions and fuzzy optimization
  54. Stability property of the prey free equilibrium point
  55. Rayleigh-Ritz Majorization Error Bounds for the Linear Response Eigenvalue Problem
  56. Hyper-Wiener indices of polyphenyl chains and polyphenyl spiders
  57. Razumikhin-type theorem on time-changed stochastic functional differential equations with Markovian switching
  58. Fixed Points of Meromorphic Functions and Their Higher Order Differences and Shifts
  59. Properties and Inference for a New Class of Generalized Rayleigh Distributions with an Application
  60. Nonfragile observer-based guaranteed cost finite-time control of discrete-time positive impulsive switched systems
  61. Empirical likelihood confidence regions of the parameters in a partially single-index varying-coefficient model
  62. Algebraic loop structures on algebra comultiplications
  63. Two weight estimates for a class of (p, q) type sublinear operators and their commutators
  64. Dynamic of a nonautonomous two-species impulsive competitive system with infinite delays
  65. 2-closures of primitive permutation groups of holomorph type
  66. Monotonicity properties and inequalities related to generalized Grötzsch ring functions
  67. Variation inequalities related to Schrödinger operators on weighted Morrey spaces
  68. Research on cooperation strategy between government and green supply chain based on differential game
  69. Extinction of a two species competitive stage-structured system with the effect of toxic substance and harvesting
  70. *-Ricci soliton on (κ, μ)′-almost Kenmotsu manifolds
  71. Some improved bounds on two energy-like invariants of some derived graphs
  72. Pricing under dynamic risk measures
  73. Finite groups with star-free noncyclic graphs
  74. A degree approach to relationship among fuzzy convex structures, fuzzy closure systems and fuzzy Alexandrov topologies
  75. S-shaped connected component of radial positive solutions for a prescribed mean curvature problem in an annular domain
  76. On Diophantine equations involving Lucas sequences
  77. A new way to represent functions as series
  78. Stability and Hopf bifurcation periodic orbits in delay coupled Lotka-Volterra ring system
  79. Some remarks on a pair of seemingly unrelated regression models
  80. Lyapunov stable homoclinic classes for smooth vector fields
  81. Stabilizers in EQ-algebras
  82. The properties of solutions for several types of Painlevé equations concerning fixed-points, zeros and poles
  83. Spectrum perturbations of compact operators in a Banach space
  84. The non-commuting graph of a non-central hypergroup
  85. Lie symmetry analysis and conservation law for the equation arising from higher order Broer-Kaup equation
  86. Positive solutions of the discrete Dirichlet problem involving the mean curvature operator
  87. Dislocated quasi cone b-metric space over Banach algebra and contraction principles with application to functional equations
  88. On the Gevrey ultradifferentiability of weak solutions of an abstract evolution equation with a scalar type spectral operator on the open semi-axis
  89. Differential polynomials of L-functions with truncated shared values
  90. Exclusion sets in the S-type eigenvalue localization sets for tensors
  91. Continuous linear operators on Orlicz-Bochner spaces
  92. Non-trivial solutions for Schrödinger-Poisson systems involving critical nonlocal term and potential vanishing at infinity
  93. Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
  94. A quantitative obstruction to collapsing surfaces
  95. Dynamic behaviors of a Lotka-Volterra type predator-prey system with Allee effect on the predator species and density dependent birth rate on the prey species
  96. Coexistence for a kind of stochastic three-species competitive models
  97. Algebraic and qualitative remarks about the family yy′ = (αxm+k–1 + βxmk–1)y + γx2m–2k–1
  98. On the two-term exponential sums and character sums of polynomials
  99. F-biharmonic maps into general Riemannian manifolds
  100. Embeddings of harmonic mixed norm spaces on smoothly bounded domains in ℝn
  101. Asymptotic behavior for non-autonomous stochastic plate equation on unbounded domains
  102. Power graphs and exchange property for resolving sets
  103. On nearly Hurewicz spaces
  104. Least eigenvalue of the connected graphs whose complements are cacti
  105. Determinants of two kinds of matrices whose elements involve sine functions
  106. A characterization of translational hulls of a strongly right type B semigroup
  107. Common fixed point results for two families of multivalued A–dominated contractive mappings on closed ball with applications
  108. Lp estimates for maximal functions along surfaces of revolution on product spaces
  109. Path-induced closure operators on graphs for defining digital Jordan surfaces
  110. Irreducible modules with highest weight vectors over modular Witt and special Lie superalgebras
  111. Existence of periodic solutions with prescribed minimal period of a 2nth-order discrete system
  112. Injective hulls of many-sorted ordered algebras
  113. Random uniform exponential attractor for stochastic non-autonomous reaction-diffusion equation with multiplicative noise in ℝ3
  114. Global properties of virus dynamics with B-cell impairment
  115. The monotonicity of ratios involving arc tangent function with applications
  116. A family of Cantorvals
  117. An asymptotic property of branching-type overloaded polling networks
  118. Almost periodic solutions of a commensalism system with Michaelis-Menten type harvesting on time scales
  119. Explicit order 3/2 Runge-Kutta method for numerical solutions of stochastic differential equations by using Itô-Taylor expansion
  120. L-fuzzy ideals and L-fuzzy subalgebras of Novikov algebras
  121. L-topological-convex spaces generated by L-convex bases
  122. An optimal fourth-order family of modified Cauchy methods for finding solutions of nonlinear equations and their dynamical behavior
  123. New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices
  124. Hankel determinant of order three for familiar subsets of analytic functions related with sine function
  125. On some automorphic properties of Galois traces of class invariants from generalized Weber functions of level 5
  126. Results on existence for generalized nD Navier-Stokes equations
  127. Regular Banach space net and abstract-valued Orlicz space of range-varying type
  128. Some properties of pre-quasi operator ideal of type generalized Cesáro sequence space defined by weighted means
  129. On a new convergence in topological spaces
  130. On a fixed point theorem with application to functional equations
  131. Coupled system of a fractional order differential equations with weighted initial conditions
  132. Rough quotient in topological rough sets
  133. Split Hausdorff internal topologies on posets
  134. A preconditioned AOR iterative scheme for systems of linear equations with L-matrics
  135. New handy and accurate approximation for the Gaussian integrals with applications to science and engineering
  136. Special Issue on Graph Theory (GWGT 2019)
  137. The general position problem and strong resolving graphs
  138. Connected domination game played on Cartesian products
  139. On minimum algebraic connectivity of graphs whose complements are bicyclic
  140. A novel method to construct NSSD molecular graphs
Downloaded on 24.12.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2019-0069/html
Scroll to top button