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

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

  • Yilun Shang EMAIL logo
Published/Copyright: September 15, 2016

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).

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
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.

Proof

Notice that i=2n1ai(n2)a1 and anni=1nai. Therefore, i=2n1ai+nan(n2)a1+n(i=1nai)1n. The result follows immediately. The equality condition is also clear.

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.

Proof

First, recall that a vertex of a graph is said to be pendant if its neighborhood contains exactly one vertex. The edge incident to a pendant vertex is called a pendant edge. Let B(G)^ represent the graph obtained from B(G) by subdividing all pendant edges in B(G) (if they exist). Clearly, by Definition 1.1 we have

τ(Γ(G))^=τ(L(B(G))^).(4)

See Fig. 2 for an illustration (the purple node is inserted to subdivide the pendant edge).

To proceed, we will need the following edge-weighted graphs [23]. Define H′ as the edge-weighted version of BG with the weight function ω:E(G)[0,) satisfying ω(e)=d(u)d(υ)d(u)d(υ)+d(u)+d(υ) for e={u, υ} ∈ E(G). Define H′ as the edge-weighted version of B(G) with the weight function ω:E(B(G))[0,) satisfying ω(e)=d(u)d(υ)d(u)+d(υ) for e=u,υE(B(G)). Define H″ as the edge-weighted version of B(B(G)) with the weight function w″ such that w″(e) = d(u) for e = {u, v} ∈ E(B(B(G))) with uV(B(G)). Finally, define H‴ as the edge-weighted version of L(B(G))^ with the weight function w‴ such that w‴(e) ≡ 1 for every eE(L(B(G))^).

It is critical to observe that, as electrical networks, H″ can be obtained from H‴ by performing a series of mesh-star transformations taking each vertex vV(B(G)) as the center of the star (see e.g. the blue and red nodes in Fig. 2). Hence, it follows from (2) and the effect of mesh-star transformation that

τ(L(B(G))^)=σ(H)=σ(H)υV(B(G))1d2(υ)=14mσ(H)υV(G)1d2(υ),(5)

where m := |E(G)| since each vertex in V(B(G))\V(G) has degree two and |V(B(G))\V(G)| = m (see e.g. the red nodes in Fig. 2).

Since H′ can be obtained from H″ by applying a series of serial edges transformations, we have

σ(H)=σ(H)e=u,υE(B(G))(d(u)+d(υ))=σ(H)υV(G)(d(u)+2)d(υ),(6)

where the second equality holds since each edge in B(G) must have a degree-two vertex. Likewise, we obtain

σ(H)=σ(H)e=u,υE(G)2d(u)d(u)+2+2d(υ)d(υ)+2=4mσ(H)e=u,υE(G)d(u)d(υ)+d(u)+d(υ)(d(u)+2)(d(υ)+2),(7)

again by noting that each edge in B(G) contains a degree-two vertex.

Now, combining (5), (6), and (7) with (4), we have

τ(Γ(G))=τ(L(B(G))^)=14mσ(H)υV(G)1d2(υ)=14mσ(H)υV(G)(d(υ)+2)d(υ)d2(υ)
=σ(H)υV(G)(d(υ)+2)d(υ)d2(υ)e=u,υE(G)d(u)d(υ)+d(u)+d(υ)(d(u)+2)(d(υ)+2).(8)

In view of (2), we obtain

σ(H)=TT(G)e=u,υE(T)d(u)d(υ)d(u)d(υ)+d(u)+d(υ).(9)

Hence, we readily obtain the expression (3) for τ(Г(G)) by plugging (9) into (8). The proof is complete.

Fig. 2 An example of some related operations on a graph G with n = |V(G)| = 5 vertices and m = |E(G)| 5 edges
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.

Proof

For each edge {u, v} ∈ E(Г(G)), the vertices u and v correspond to two incident edges, say, {u1, u2}, {u2, u3}, in B(G). If u and v have k common neighbors, then we have

dΓ(G)(u)+dΓ(G)(υ)2k=dB(G)(u1)+dB(G)(u3)

and dB(G)u2=k+2. Consequently,

dΓ(G)(u)+dΓ(G)(υ)=dB(G)(u1)+dB(G)(u3)+2dB(G)(u2)4

holds.

We consider two situations. (1) If u2V(B(G))V(G),thendB(G)(u2)=2. Hence, dΓ(G)(u)+dΓ(G)(υ)=dG(u1)+dG(u3), where u1 and u3 are adjacent in G. (2) If u2V(G),thendB(G)(u1)=dB(G)(u3)=2. Hence, dΓ(G)(u)+dΓ(G)(υ)=2dG(u2).

Thanks to Lemma 2.1, we obtain

λ1(Γ(G))max{2maxυV(G)dG(υ),max{u,υ}E(G){dG(u)+dG(υ)}}2Δ(G).

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.

Proof

We know that |V(Г(G))| = |E(B(G))|=2|E(G)| by Definition 1.1. Moreover, based on the property of line graphs (see e.g. [25, Theorem 8.1]), we have

|E(Γ(G))|=12υV(B(G))dB(G)2(υ)|E(B(G))|=12υV(G)dG2(υ)+4|E(G)|2|E(G)|=12Zg(G).

Therefore, we readily arrive at (11) by employing Lemma 2.2.

We now discuss the sharpness of (11). If G is a single edge, then Г(G) = G. Lemma 2.2 implies that the equality holds in (11). Conversely, if the equality holds in (11), it follows from Lemma 2.2 that Г(G) must be a complete graph. But this is true only if G is a single edge. (Indeed, if G is not a single edge, G must contain a 2-path P2. Clearly, there are two vertices in Г(P2) that are not adjacent, and hence Г(G) cannot be complete.)

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.

Proof

By (1) and 2m = 2|E(G)| = |V(Г(G))|,

LEE(Γ(G))=i=12meλi(Γ(G))=k=01k!i=12mλik(Γ(G))=2m+k=1i=12m1λik(Γ(G))k!,(15)

where we have used the fact that Г(G) is connected (and hence λ2m (Г(G)) = 0).

Recall that the matrix-tree theorem tells us that τ(Γ(G))=12mi=12m1λi(Γ(G)), where τ(Г(G)) is given by (3). The first inequality in (13) follows from (15) and the arithmetic-geometric mean inequality:

LEE(Γ(G))2m+k=12m1k!i=12m1λi(Γ(G))k2m1=2m+(2m1)k=11k!2mτ(Γ(G)))k2m1=2m+(2m1)e2mτ(Γ(G))12m11,

where the equality holds if and only if Г (G) is a complete graph, which is again equivalent to the condition that G is a single edge (see the proof of Theorem 4.2).

For the second inequality in (13), we need to resort to Lemma 2.3. Similarly, we have

LEE(Γ(G))2m+k=12m1k!i=12m1λi(Γ(G))k2m1+k=12m2k!λ1k(Γ(G))λ2m1k(Γ(G))=(2m1)e2mτ(Γ(G))12m11+(2m2)mm1+eλ1(Γ(G))eλ2m1(Γ(G)),

where the equality holds if G is a single edge.

The last statement concerning the inequality (14) follows by applying Theorem 4.1 and Theorem 4.2 to (13).

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-17610.1016/0024-3795(94)90486-3Search in Google Scholar

[2] Fiedler M., Algebraic connectivity of graphs, Czech. Math. J., 1973, 23, 298-30510.21136/CMJ.1973.101168Search in Google Scholar

[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-10410.1023/A:1022444205860Search in Google Scholar

[4] Klavžar S., Milutinović U., Petr C., 1-perfect codes in Sierpiński graphs, Bull. Austral. Math. Soc., 2002, 66, 369-38410.1017/S0004972700040235Search in Google Scholar

[5] Hasunuma T., Structural properties of subdivided-line graphs, J. Discrete Algorithms, 2015, 31, 69-8610.1007/978-3-642-45278-9_19Search in Google Scholar

[6] Nikolopoulos S.D., Papadopoulos C., The number of spanning trees in Kn-complements of quasi-threshold graphs, Graphs Combin., 2004, 20, 383-39710.1007/s00373-004-0568-xSearch in Google Scholar

[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-11910.1016/S0020-0190(00)00135-6Search in Google Scholar

[8] Zhang Z.Z., Wu B., Comellas F., The number of spanning trees in Apollonian networks, Discrete Appl. Math., 2014, 169, 206-21310.1016/j.dam.2014.01.015Search in Google Scholar

[9] Hinz A., Klavžar S., Zemljić S., Sierpiński graphs as spanning subgraphs of Hanoi graphs, Cent. Eur. J. Math., 2013, 11, 1153-115710.2478/s11533-013-0227-7Search in Google Scholar

[10] Xiao J., Zhang J., Sun W., Enumeration of spanning trees on generalized pseudofractal networks, Fractals, 2015, 23, 155002110.1142/S0218348X15500218Search in Google Scholar

[11] Sun W., Wang S., Zhang J., Counting spanning trees in prism and anti-prism graphs, J. Appl. Anal. Comp., 2016, 6, 65-7510.11948/2016006Search in Google Scholar

[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-50810.1002/andp.18471481202Search in Google Scholar

[13] Garey M.R., Johnson D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979Search in Google Scholar

[14] Teufl E., Wagner S., Determinant identities for Laplace matrice, Lin. Algebra Appl., 2010, 432, 441-45710.1016/j.laa.2009.08.028Search in Google Scholar

[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-16Search in Google Scholar

[16] Estrada E., Characterization of 3D molecular structure, Chem. Phys. Lett., 2000, 319, 713-71810.1016/S0009-2614(00)00158-5Search in Google Scholar

[17] Zhou B., Gutman I., More on the Laplacian Estrada index, Appl. Anal. Discrete Math., 2009, 3, 371-37810.2298/AADM0902371ZSearch in Google Scholar

[18] Shang Y., Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs, PLoS ONE, 2015, 10, e012342610.1371/journal.pone.0123426Search in Google Scholar

[19] Chen X., Hou Y., Some results on Laplacian Estrada index of graphs, MATCH Commun. Math. Comput. Chem., 2015, 73, 149-162Search in Google Scholar

[20] Shang Y., Estrada and L-Estrada indices of edge-independent random graphs, Symmetry, 2015, 7, 1455-146210.3390/sym7031455Search in Google Scholar

[21] Anderson W.N., Morley T.D., Eigenvalues of the Laplacian of a graph, Linear Multilinear Algebra, 1985, 18, 141-14510.1080/03081088508817681Search in Google Scholar

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

[23] Gong H., Jin X., A formula for the number of the spanning trees of line graphs, arXiv:1507.063891Search in Google Scholar

[24] Gutman I., Das K.Ch., The first Zagreb index 30 years after, MATCH Commun. Math. Comput. Chem., 2004, 50, 83-92Search in Google Scholar

[25] Harary F., Graph Theory, Addison-Wesley, Massachusetts, 1971Search in Google Scholar

[26] Mohar B., Eigenvalues, diameter, and mean distance in graphs, Graphs Combin., 1991, 7, 53-6410.1007/BF01789463Search in Google Scholar

[27] Hedman B., Clique graphs of time graphs, J. Combin. Th. Ser. B, 1984, 37, 270-27810.1016/0095-8956(84)90059-5Search in Google Scholar

[28] Hedman B., Diameters of iterated clique graphs, Hadronic J., 1986, 9, 273-276Search in Google Scholar

Received: 2016-5-27
Accepted: 2016-8-9
Published Online: 2016-9-15
Published in Print: 2016-1-1

© 2016 Shang, published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Articles in the same Issue

  1. Regular Article
  2. A metric graph satisfying w41=1 that cannot be lifted to a curve satisfying dim(W41)=1
  3. Regular Article
  4. On the Riemann-Hilbert problem in multiply connected domains
  5. Regular Article
  6. Hamilton cycles in almost distance-hereditary graphs
  7. Regular Article
  8. Locally adequate semigroup algebras
  9. Regular Article
  10. Parabolic oblique derivative problem with discontinuous coefficients in generalized weighted Morrey spaces
  11. Corrigendum
  12. Corrigendum to: parabolic oblique derivative problem with discontinuous coefficients in generalized weighted Morrey spaces
  13. Regular Article
  14. Some new bounds of the minimum eigenvalue for the Hadamard product of an M-matrix and an inverse M-matrix
  15. Regular Article
  16. Integral inequalities involving generalized Erdélyi-Kober fractional integral operators
  17. Regular Article
  18. Results on the deficiencies of some differential-difference polynomials of meromorphic functions
  19. Regular Article
  20. General numerical radius inequalities for matrices of operators
  21. Regular Article
  22. The best uniform quadratic approximation of circular arcs with high accuracy
  23. Regular Article
  24. Multiple gcd-closed sets and determinants of matrices associated with arithmetic functions
  25. Regular Article
  26. A note on the rate of convergence for Chebyshev-Lobatto and Radau systems
  27. Regular Article
  28. On the weakly(α, ψ, ξ)-contractive condition for multi-valued operators in metric spaces and related fixed point results
  29. Regular Article
  30. Existence of a common solution for a system of nonlinear integral equations via fixed point methods in b-metric spaces
  31. Regular Article
  32. Bounds for the Z-eigenpair of general nonnegative tensors
  33. Regular Article
  34. Subsymmetry and asymmetry models for multiway square contingency tables with ordered categories
  35. Regular Article
  36. End-regular and End-orthodox generalized lexicographic products of bipartite graphs
  37. Regular Article
  38. Refinement of the Jensen integral inequality
  39. Regular Article
  40. New iterative codes for 𝓗-tensors and an application
  41. Regular Article
  42. A result for O2-convergence to be topological in posets
  43. Regular Article
  44. A fixed point approach to the Mittag-Leffler-Hyers-Ulam stability of a fractional integral equation
  45. Regular Article
  46. Uncertainty orders on the sublinear expectation space
  47. Regular Article
  48. Generalized derivations of Lie triple systems
  49. Regular Article
  50. The BV solution of the parabolic equation with degeneracy on the boundary
  51. Regular Article
  52. Malliavin method for optimal investment in financial markets with memory
  53. Regular Article
  54. Parabolic sublinear operators with rough kernel generated by parabolic calderön-zygmund operators and parabolic local campanato space estimates for their commutators on the parabolic generalized local morrey spaces
  55. Regular Article
  56. On annihilators in BL-algebras
  57. Regular Article
  58. On derivations of quantales
  59. Regular Article
  60. On the closed subfields of Q¯~p
  61. Regular Article
  62. A class of tridiagonal operators associated to some subshifts
  63. Regular Article
  64. Some notes to existence and stability of the positive periodic solutions for a delayed nonlinear differential equations
  65. Regular Article
  66. Weighted fractional differential equations with infinite delay in Banach spaces
  67. Regular Article
  68. Laplace-Stieltjes transform of the system mean lifetime via geometric process model
  69. Regular Article
  70. Various limit theorems for ratios from the uniform distribution
  71. Regular Article
  72. On α-almost Artinian modules
  73. Regular Article
  74. Limit theorems for the weights and the degrees in anN-interactions random graph model
  75. Regular Article
  76. An analysis on the stability of a state dependent delay differential equation
  77. Regular Article
  78. The hybrid mean value of Dedekind sums and two-term exponential sums
  79. Regular Article
  80. New modification of Maheshwari’s method with optimal eighth order convergence for solving nonlinear equations
  81. Regular Article
  82. On the concept of general solution for impulsive differential equations of fractional-order q ∈ (2,3)
  83. Regular Article
  84. A Riesz representation theory for completely regular Hausdorff spaces and its applications
  85. Regular Article
  86. Oscillation of impulsive conformable fractional differential equations
  87. Regular Article
  88. Dynamics of doubly stochastic quadratic operators on a finite-dimensional simplex
  89. Regular Article
  90. Homoclinic solutions of 2nth-order difference equations containing both advance and retardation
  91. Regular Article
  92. When do L-fuzzy ideals of a ring generate a distributive lattice?
  93. Regular Article
  94. Fully degenerate poly-Bernoulli numbers and polynomials
  95. Commentary
  96. Commentary to: Generalized derivations of Lie triple systems
  97. Regular Article
  98. Simple sufficient conditions for starlikeness and convexity for meromorphic functions
  99. Regular Article
  100. Global stability analysis and control of leptospirosis
  101. Regular Article
  102. Random attractors for stochastic two-compartment Gray-Scott equations with a multiplicative noise
  103. Regular Article
  104. The fuzzy metric space based on fuzzy measure
  105. Regular Article
  106. A classification of low dimensional multiplicative Hom-Lie superalgebras
  107. Regular Article
  108. Structures of W(2.2) Lie conformal algebra
  109. Regular Article
  110. On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs
  111. Regular Article
  112. Parabolic Marcinkiewicz integrals on product spaces and extrapolation
  113. Regular Article
  114. Prime, weakly prime and almost prime elements in multiplication lattice modules
  115. Regular Article
  116. Pochhammer symbol with negative indices. A new rule for the method of brackets
  117. Regular Article
  118. Outcome space range reduction method for global optimization of sum of affine ratios problem
  119. Regular Article
  120. Factorization theorems for strong maps between matroids of arbitrary cardinality
  121. Regular Article
  122. A convergence analysis of SOR iterative methods for linear systems with weak H-matrices
  123. Regular Article
  124. Existence theory for sequential fractional differential equations with anti-periodic type boundary conditions
  125. Regular Article
  126. Some congruences for 3-component multipartitions
  127. Regular Article
  128. Bound for the largest singular value of nonnegative rectangular tensors
  129. Regular Article
  130. Convolutions of harmonic right half-plane mappings
  131. Regular Article
  132. On homological classification of pomonoids by GP-po-flatness of S-posets
  133. Regular Article
  134. On CSQ-normal subgroups of finite groups
  135. Regular Article
  136. The homogeneous balance of undetermined coefficients method and its application
  137. Regular Article
  138. On the saturated numerical semigroups
  139. Regular Article
  140. The Bruhat rank of a binary symmetric staircase pattern
  141. Regular Article
  142. Fixed point theorems for cyclic contractive mappings via altering distance functions in metric-like spaces
  143. Regular Article
  144. Singularities of lightcone pedals of spacelike curves in Lorentz-Minkowski 3-space
  145. Regular Article
  146. An S-type upper bound for the largest singular value of nonnegative rectangular tensors
  147. Regular Article
  148. Fuzzy ideals of ordered semigroups with fuzzy orderings
  149. Regular Article
  150. On meromorphic functions for sharing two sets and three sets in m-punctured complex plane
  151. Regular Article
  152. An incremental approach to obtaining attribute reduction for dynamic decision systems
  153. Regular Article
  154. Very true operators on MTL-algebras
  155. Regular Article
  156. Value distribution of meromorphic solutions of homogeneous and non-homogeneous complex linear differential-difference equations
  157. Regular Article
  158. A class of 3-dimensional almost Kenmotsu manifolds with harmonic curvature tensors
  159. Regular Article
  160. Robust dynamic output feedback fault-tolerant control for Takagi-Sugeno fuzzy systems with interval time-varying delay via improved delay partitioning approach
  161. Regular Article
  162. New bounds for the minimum eigenvalue of M-matrices
  163. Regular Article
  164. Semi-quotient mappings and spaces
  165. Regular Article
  166. Fractional multilinear integrals with rough kernels on generalized weighted Morrey spaces
  167. Regular Article
  168. A family of singular functions and its relation to harmonic fractal analysis and fuzzy logic
  169. Regular Article
  170. Solution to Fredholm integral inclusions via (F, δb)-contractions
  171. Regular Article
  172. An Ulam stability result on quasi-b-metric-like spaces
  173. Regular Article
  174. On the arrowhead-Fibonacci numbers
  175. Regular Article
  176. Rough semigroups and rough fuzzy semigroups based on fuzzy ideals
  177. Regular Article
  178. The general solution of impulsive systems with Riemann-Liouville fractional derivatives
  179. Regular Article
  180. A remark on local fractional calculus and ordinary derivatives
  181. Regular Article
  182. Elastic Sturmian spirals in the Lorentz-Minkowski plane
  183. Topical Issue: Metaheuristics: Methods and Applications
  184. Bias-variance decomposition in Genetic Programming
  185. Topical Issue: Metaheuristics: Methods and Applications
  186. A novel generalized oppositional biogeography-based optimization algorithm: application to peak to average power ratio reduction in OFDM systems
  187. Special Issue on Recent Developments in Differential Equations
  188. Modeling of vibration for functionally graded beams
  189. Special Issue on Recent Developments in Differential Equations
  190. Decomposition of a second-order linear time-varying differential system as the series connection of two first order commutative pairs
  191. Special Issue on Recent Developments in Differential Equations
  192. Differential equations associated with generalized Bell polynomials and their zeros
  193. Special Issue on Recent Developments in Differential Equations
  194. Differential equations for p, q-Touchard polynomials
  195. Special Issue on Recent Developments in Differential Equations
  196. A new approach to nonlinear singular integral operators depending on three parameters
  197. Special Issue on Recent Developments in Differential Equations
  198. Performance and stochastic stability of the adaptive fading extended Kalman filter with the matrix forgetting factor
  199. Special Issue on Recent Developments in Differential Equations
  200. On new characterization of inextensible flows of space-like curves in de Sitter space
  201. Special Issue on Recent Developments in Differential Equations
  202. Convergence theorems for a family of multivalued nonexpansive mappings in hyperbolic spaces
  203. Special Issue on Recent Developments in Differential Equations
  204. Fractional virus epidemic model on financial networks
  205. Special Issue on Recent Developments in Differential Equations
  206. Reductions and conservation laws for BBM and modified BBM equations
  207. Special Issue on Recent Developments in Differential Equations
  208. Extinction of a two species non-autonomous competitive system with Beddington-DeAngelis functional response and the effect of toxic substances
Downloaded on 17.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2016-0055/html
Scroll to top button