Home Enumeration of spanning trees in the sequence of Dürer graphs
Article Open Access

Enumeration of spanning trees in the sequence of Dürer graphs

  • Shixing Li EMAIL logo
Published/Copyright: December 29, 2017

Abstract

In this paper, we calculate the number of spanning trees in the sequence of Dürer graphs with a special feature that it has two alternate states. Using the electrically equivalent transformations, we obtain the weights of corresponding equivalent graphs and further derive relationships for spanning trees between the Dürer graphs and transformed graphs. By algebraic calculations, we obtain a closed-form formula for the number of spanning trees with regard to iteration step. Finally we compare the entropy of our graph with other studied graphs and see that its value of entropy lies in the interval of those of graphs with average degree being 3 and 4.

MSC 2010: 05C30; 05C50; 05C63

1 Introduction

In the study of networks, spanning trees are related to many aspects of networks, such as reliability [1, 2], consensus [3], random walks [4] and nonlinear dynamics [5, 6]. A spanning tree of a connected graph is defined as a minimal set of edges that connect all its nodes. On the other hand, enumeration of spanning trees has been applied in mathematics [7], computer science [8, 9], physics [10, 11], and chemistry [12], to name just a few.

Recently, counting the number of spanning trees has attracted increasing attention [13, 14, 15, 16]. It is known that the number of spanning trees can be obtained by matrix-tree theorem [13]. Due to the complexity and diversity of networks, analytically enumerating spanning trees is challenging. For fractal networks, the existing works [17, 18, 19, 20] applied the self-similarity, spanning forests, and Laplacian spectrum to obtain exact formulae of spanning trees, while for some self-similar graphs, e.g., generalized Petersen graphs, those methods are not effective. Recently, the enumeration of spanning trees has been investigated by the electrically equivalent transformations in Refs. [21, 22, 23].

A sequence of Dürer graphs is the skeleton of Dürer’s solid, which belongs to generalized Petersen graphs. This graph has a special feature that it has two alternate states. Calculating the number of spanning trees in this family of graph by its laplacian spectrum does not work. To the best of our knowledge, few analytical results involve the derivation of enumeration of spanning trees. Here we employ the knowledge of electrical networks, where an edge-weighted graph is regarded as an electrical network with the weights equalling the conductances of the corresponding edges. Using the electrically equivalent transformations provided in Refs. [24, 25], we obtain some relationships for spanning trees between the original graph and transformed graphs. We then obtain a closed-form formula for enumeration of spanning trees. Finally we calculate the entropy of spanning trees and compare it with those of other studied graphs.

In Section 2, the construction of the sequence of Dürer graphs is presented. Section 3 shows the electrically equivalent transformations of graphs. The detailed calculations of spanning trees are provided in Section 4. Finally, the conclusions are included in the last section.

2 Model presentation

The sequence of Dürer graphs is denoted by Gn(n ≥ 1) after n steps, which is constructed as follows:

For n = 1, G1 is a triangle.

For n = 2, G2 is obtained from G1, where a hexagon is put into the triangle and three new adjacent nodes in the hexagon are connected to the nodes in the triangle.

For n ≥ 3, Gn is produced by Gn−1. If n is an even number, a hexagon is inserted into Gn−1; if n is an odd number, a triangle is embedded into Gn−1. Figure 1 shows this construction process.

Figure 1 
The Dürer graphs Gn produced at steps n = 1, 2, 3 and 4.
Figure 1

The Dürer graphs Gn produced at steps n = 1, 2, 3 and 4.

According to the construction, the number of total vertices Vn and edges En are,

Vn=9n232,En=15n292,n=1,3,,

and

Vn=9n2,En=15n23,n=2,4,.

Then the average degree is 〈kn = 2EnVn, which is approximately 103 for a large t.

3 Electrically equivalent transformations

According to the structures of Gn, the final state is either a triangle or a hexagon. When the final state is a hexagon, using the star-triangle electrically equivalent transformation, we obtain a new graph, denoted by Ft and the weights in the new triangles become 13 , other edge weights remain unchanged. Figure 2 shows the transformation between G2 and F1. Using the results in Ref. [24], we transform a star graph with weights a, b and c to a triangle graph H*, where the weights are bca+b+c,aca+b+c and aba+b+c. Then we obtain the relationship of weighted spanning trees between H and H*, i.e., τ(H) = (a + b + c)τ(H*). Since the graph Gn contains 32 n identical star graphs, we obtain

τ(Gn)=332nτ(Ft). (1)
Figure 2 
The transformation from G2 to F1.
Figure 2

The transformation from G2 to F1.

In the same way, when the final state is a triangle, we transform Gn into Ft . Figure 3 gives the transformation between G3 and F1 . The weighted spanning trees reads as

τ(Gn)=332(n1)τ(Ft). (2)
Figure 3 
The transformation from G3 to 
F1∗
$F_{1}^{*} $.
Figure 3

The transformation from G3 to F1 .

In order to calculate the functions τ(Ft) and τ( Ft ), we provide the following two Lemmas and three corollaries.

Lemma 3.1

For the edge-weighted graph F1 (see Fig. 4), suppose the weights of the innermost triangle, outermost triangle and the linked edges are a, c and b, respectively. Then, we have

τ(F1)=6b(2ab+2bc+3ac+b2)2.
Figure 4 
The transformations from F1 to X5.
Figure 4

The transformations from F1 to X5.

Proof

We firstly transform the innermost triangle with weights a into an electrically equivalent star graph denoted by X1 with weights 3a, then τ(X1) = 9(F1).

Using the star-triangle transformation, three star graphs are changed into three connected curved edge triangles, where the weights of innermost six curved edges are 3ab3a+2b, and the weights of outer three curved edges are b23a+2b. The transformed graph is denoted by X2, then τ(X2) = (13a+2b)3 τ(X1).

Merging six pairs of parallel edges into single edges produces a new graph denoted by X3, which includes a triangle with weights c + b23a+2b and a star graph with weights 6ab3a+2b. Then τ(X3) = τ(X2). Using the star-triangle transformation again, we obtain a curved edge triangle with weights 2ab3a+2b, then τ(X4) = 3a+2b18ab τ(X3).

Finally, merging two parallel edges into a single edge to form a new triangle with weights c + b2+2ab3a+2b, we obtain τ(X5) = τ(X4). Through the above five transformations, we obtain τ(F1) = 6b(2ab + 2bc + 3ac + b2)2. The whole electrically equivalent transformations from F1 to X5 are shown in Fig. 4.□

Lemma 3.2

For the edge-weighted graph Y1(see Fig. 5), the weights of the innermost triangle, outermost triangle and the linked edges are x, z and y. Then,

τ(Y1)=3y(xy+3xz+yz)2.

Proof

Using the same transformation between F1 and X1, we change Y1 into Y2, then τ(Y2) = 9(Y1). Merging two serial edges with the weights 3x and y into a single edge with the weight 3xy3x+y, we obtain τ(Y3) = 1(3x+y)3 τ(Y2). Then implementing the star-triangle transformation and the curved edge triangle with weights xy3x+y. Thus, τ(Y4)=3x+y9xyτ(Y3).

Finally merging parallel edges into a single edge with weight z + xy3x+y gives τ(Y5) = τ(Y4). Combining the above-mentioned transformation, we obtain τ(Y1) = 3y(xy + 3xz + yz)2. Figure 5 gives the electrically equivalent transformations between Y1 and Y5. According to Lemmas 3.1 and 3.2, we obtain the following corollaries.

Figure 5 
The transformations from Y1 to Y5.
Figure 5

The transformations from Y1 to Y5.

Corollary 3.3

Considering a new graph F2 formed by connecting two graphs F1 through three edges with the weight y, we obtain

τ(F2)=2by(2b+3a)2(3x+y)2τ(F1),

where x = c + b2+2ab3a+2b.

Proof

Based on the transformations in Fig. 6, we have τ(F2) = 2b(2b + 3a)2τ( F1 ) and τ( F1 ) = y(3x + y)2τ(F1).

Figure 6 
The transformations from F2 to F1.
Figure 6

The transformations from F2 to F1.

Corollary 3.4

Based on the transformations of F2, we obtain a relationship of enumerating spanning trees between Ft and F1, i.e.,

τ(Ft)=(23)t1i=2t(3+14ri)2τ(F1), (3)

where ri = 16+75ri+127+126ri+1, and ri is the edge weights in the innermost triangle of Fi.

Proof

According to the transformations (F1X5 and Y1Y5) in Figs. 4 and 6, we obtain x = c+b2+2ab3a+2b and r1 = z + xy3x+y. Let z=b=13, c = y = 1, a = r2, it gives x = 33r2+727r2+6 and r1=16+75r227+126r2. Further, τ(F2) = 23 (3 + 14r2)2τ(F1). Through the transformations between Ft and F1 and by induction, Equation (3) holds.□

Corollary 3.5

The graphs Ft are produced by inserting a triangle with the weights 1 into Ft, and connecting them by linked-edges with the weights 1. Then,

τ(Ft)=16τ(Ft). (4)

Proof

Let x = y = 1, z = 13 and from Lemma 3.2, it gives τ(Y1) = 16τ(Y5). Using the transformations from Ft to Ft, Corollary 3.5 is established.□

4 Calculating the number of spanning trees

Using the expression rt1=16+75rt27+126rt and denoting the coefficients of 27 + 126rt and 16 + 75rt as At and Bt, we obtain

3+14rt=A0(27+126rt)+B0(16+75rt),3+14rt1=A1(27+126rt)+B1(16+75rt)9[A0(27+126rt)+B0(16+75rt],3+14rti=Ai(27+126rt)+Bi(16+75rt)9[Ai1(27+126rt)+Bi1(16+75rt], (5)

3+14rt(i+1)=Ai+1(27+126rt)+Bi+1(16+75rt)9[Ai(27+126rt)+Bi(16+75rt],3+14r2=At2(27+126rt)+Bt2(16+75rt)9[At3(27+126rt)+Bt3(16+75rt)], (6)

where A0 = 19 , B0 = 0; A1 = 3, B1 = 14. Substituting Eq. (5) into Eq. (3) yields

τ(Ft)=2t135t+9[At2(27+126rt)+Bt2(16+75rt)]2τ(F1). (7)

Let a = r1, b = 13 , c = 1 and from Lemma 3.1, we obtain

τ(F1)=281(7+33r1)2. (8)

By the relationship between rt and rt−1 and Eqs. (5) and (6), we obtain

At+1=102At9At1;Bt+1=102Bt9Bt1.

Their characteristic equation is

λ2102λ+9=0,

with two roots being λ1=51+362 and λ2=51362. Then the general solutions are

At=a1λ1t+a2λ2t;Bt=b1λ1t+b2λ2t.

Using the initial conditions A0=19,B0=0;A1=3,B1=14 gives

At=3254λ1t+3+254λ2t;Bt=7272λ1t7272λ2t. (9)

In the sequel, we calculate the values of r1. By rt1=16+75rt27+126rt, its characteristic equation is 63x2−24x−8 = 0, which has two roots x1=4+6221 and x2=46221.

Subtracting these two roots from both sides of rt1=16+75rt27+126rt yields

rt14+6221=16+75rt27+126rt4+6221=5136227+126rt(rt4+6221),rt146221=16+75rt27+126rt46221=51+36227+126rt(rt46221).

Let at=rt4+6221rt46221, then,

at1=1712217+122at,

where

a1=r14+6221r146221=(1712217+122)t1at.

Hence, the expression of r1 reads as

r1=(624)(5774082)t1at+4+622121(5774082)t1at. (10)

If rt=13, then at=3623+62. Plugging Eqs. (7)-(10) into Eq. (1) gives

τ(Gn)=2n23n+5(92+65224λ1n42+9265224λ2n42)2(7+33r1)2,

where r1=(224)(5774082)n21+22+4(623)(5774082)n21+62+3,λ1=51+362 and λ2=51362.

If rt=712, then at=118211+82. Inserting Eqs. (4) and (7)-(10) into Eq. (2) yields

τ(Gn)=2n+723n+6(536+379296λ1n52+536379296λ2n52)2(7+33r1)2,

where r1=(14220)(5774082)n32+142+20(24233)(5774082)n32+242+33. Then, we have the following theorem.

Theorem 4.1

The enumeration of spanning trees in the sequence of Dürer graphs is as follows:

τ(Gn)=2n+7236n(536+379296λ1n52+536379296λ2n52)2Φ1,n=1,3,,2n235n(92+65224λ1n42+9265224λ2n42)2Φ2,n=2,4,,

where Φ1 = (7+33r1)2 with r1=(14220)(5774082)n32+142+20(24233)(5774082)n32+242+33 and Φ2 = (7+33r1)2 with r1 = (224)(5774082)n21+22+4(623)(5774082)n21+62+3.

5 Entropy of spanning trees

Using the obtained results for enumeration of spanning trees, we calculate the entropy of spanning trees, denoted by E(G), which is given by,

E(G)=limnlnτ(Gn)Vn,=ln22ln3+2ln(51+362)90.860.

Now we compare the value of entropy in our graph with other graphs. For the graphs with average degree 3, the entropy of infinite outerplanar small-world graphs [26] is 0.657, the values of entropy in 3-12-12 and 4-8-8 lattices [27] are 0.721 and 0.787, and the honeycomb lattice [28] is 0.807. While for the graphs with average degree 4, the entropy of the pseudofractal fractal web [29] is 0.896, the fractal scale-free lattice [20] is 1.040, the values of the two-dimensional Sierpinski gasket [15] and the square lattice [28] are 1.049 and 1.166. The entropy of spanning trees in our graph is 0.860, which is larger than those of graphs with average degree 3, but smaller than those of graphs with average degree 4.

6 Conclusions

In the present study, we have used the electrically equivalent transformations to solve the number of spanning trees in the sequence of Dürer graphs. Compared to existing methods on enumeration of spanning trees, this method is effective and simple. Applying the transformations, we have converted this graph into a triangle, and obtained the relationships of corresponding edge weights. Using the obtained method, we could calculate the spanning trees of Dürer-like graphs, e.g., the cylinders width being an even number. In addition, our results have shown that the entropy is related to the average degree, whether this conclusion holds for other graphs needs further study.

Acknowledgement

This work was supported by the Planning Project of Social Science of Zhejiang Province (Grant No. 18NDJC138YB) and First Class Discipline of Zhejiang-A (Zhejiang University of Finance and Economics-Statistics).

References

[1] Boesch F., On unreliability polynomials and graph connectivity in reliable network synthesis, J. Graph. Theor., 1986, 10, 339-35210.1002/jgt.3190100311Search in Google Scholar

[2] Szabó G., Alava M., Kertész J., Geometry of minimum spanning trees on scale-free networks, Physica A, 2003, 330, 31-36.10.1016/j.physa.2003.08.031Search in Google Scholar

[3] Sun W., Ding Q., Zhang J., Chen F., Coherence in a family of tree networks with an application of Laplacian Spectrum, Chaos, 2014, 24, 043112.10.1063/1.4897568Search in Google Scholar PubMed

[4] Dhar D., Dhar A., Distribution of sizes of erased loops for loop-erased random walks, Phys. Rev. E, 1997, 55, 2093-2096.10.1103/PhysRevE.55.R2093Search in Google Scholar

[5] Chen J., Zhang H., Qiao L., Liang H., Sun W., Interaction of excitable waves emitted from two defects by pulsed electric fields, Commun. Nonlinear Sci., 2018, 54, 202-209.10.1016/j.cnsns.2017.05.034Search in Google Scholar

[6] Liu H., Sun W., Al-mahbashi G., Parameter identification based on lag synchronization via hybrid feedback control in uncertain drive-response dynamical networks, Adv. Differ. Equ. 2017, 122.10.1186/s13662-017-1181-7Search in Google Scholar

[7] Bibak K., Shirdareh Haghighi M., Some trigonometric identities involving fibonacci and lucas numbers, J. Integer Seq., 2009, 12, 09.8.4.Search in Google Scholar

[8] Chao K., Wu B., Spanning Trees and Optimization Problems, CRC Press: Boca Raton, 2004.10.1201/9780203497289Search in Google Scholar

[9] Lyons R., Asymptotic enumeration of spanning trees, Combin. Probab. Comput., 2005, 14, 491-522.10.1017/S096354830500684XSearch in Google Scholar

[10] Goh K., Salvi G., Kahng B., Kim D., Skeleton and fractal scaling in complex networks, Phys. Rev. Lett., 2006, 96, 018701.10.1103/PhysRevLett.96.018701Search in Google Scholar PubMed

[11] Dhar D., Theoretical studies of self-organized criticality, Physica A, 2006, 369, 29-70.10.1016/j.physa.2006.04.004Search in Google Scholar

[12] Brown T., Mallion R., Pollak P., Roth A., Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes, Discrete Appl. Math., 1996, 67, 51-66.10.1016/0166-218X(96)85158-4Search in Google Scholar

[13] Teufl E., Wagner S., On the number of spanning trees on various lattices, J. Phys. A: Math. Theor., 2010, 43, 415001.10.1088/1751-8113/43/41/415001Search in Google Scholar

[14] D’Angeli D., Donno A., Weighted spanning trees on some self-similar graphs, Electron. J. Comb., 2011, 18, P16.10.37236/503Search in Google Scholar

[15] Chang S., Chen L., Yang W., Spanning trees on the Sierpinski gasket, J. Stat. Phys., 2007, 126, 649-667.10.1007/s10955-006-9262-0Search in Google Scholar

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

[17] Boesch F., Bogdanowicz Z., The number of spanning trees in a prism, Int. J. Comput. Math., 1987, 21, 229-243.10.1080/00207168708803568Search in Google Scholar

[18] Xiao Y., Zhao H., Hu G., Ma X., Enumeration of spanning trees in planar unclustered networks, Physica A, 2014, 406, 236-243.10.1016/j.physa.2014.03.028Search in Google Scholar

[19] Zhang J., Sun W., Xu G., Enumeration of spanning trees on Apollonian networks, J. Stat. Mech., 2013, P09015.10.1088/1742-5468/2013/09/P09015Search in Google Scholar

[20] Zhang Z., Liu H., Wu B., Zou T., Spanning trees in a fractal scale-free lattice, Phys. Rev. E, 2011, 83, 016116.10.1103/PhysRevE.83.016116Search in Google Scholar PubMed

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

[22] Shang Y., On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs, Open Math. 2016, 14, 641-648.10.1515/math-2016-0055Search in Google Scholar

[23] Qin S., Zhang J., Chen X., Chen F., Enumeration of spanning trees on contact graphs of disk packings, Physica A, 2015, 433, 1-8.10.1016/j.physa.2015.03.047Search in Google Scholar

[24] Teufl E., Wagner S., Determinant identities for Laplace matrices, Linear Algebra Appl., 2010, 432, 441-457.10.1016/j.laa.2009.08.028Search in Google Scholar

[25] Wagner T., Resistance scaling and the number of spanning trees in self-similar lattices, J. Stat. Phys., 2011, 142, 879-897.10.1007/s10955-011-0140-zSearch in Google Scholar

[26] Comellas F., Miralles A., Liu H., Zhang Z., The number of spanning trees of an infinite family of outer planar, small-world and self-similar graphs, Physica A, 2013, 392, 2803-2806.10.1016/j.physa.2012.10.047Search in Google Scholar

[27] Shrock R., Wu F., Spanning trees on graphs and lattices in d dimensions, J. Phys. A: Math. Theor., 2000, 33, 3881-3902.10.1088/0305-4470/33/21/303Search in Google Scholar

[28] Wu F., Number of spanning trees on a lattice, J. Phys. A: Math. Theor., 1977, 10, 113-115.10.1088/0305-4470/10/6/004Search in Google Scholar

[29] Zhang Z., Liu H., Wu B., Zhou S., Enumeration of spanning trees in a pseudofractal scale-free web, Europhys Lett., 2010, 90, 68002.10.1209/0295-5075/90/68002Search in Google Scholar

Received: 2016-10-12
Accepted: 2017-12-7
Published Online: 2017-12-29

© 2017 Li

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

Articles in the same Issue

  1. Regular Articles
  2. Integrals of Frullani type and the method of brackets
  3. Regular Articles
  4. Edge of chaos in reaction diffusion CNN model
  5. Regular Articles
  6. Calculus using proximities: a mathematical approach in which students can actually prove theorems
  7. Regular Articles
  8. An investigation on hyper S-posets over ordered semihypergroups
  9. Regular Articles
  10. The Leibniz algebras whose subalgebras are ideals
  11. Regular Articles
  12. Fixed point and multidimensional fixed point theorems with applications to nonlinear matrix equations in terms of weak altering distance functions
  13. Regular Articles
  14. Matrix rank and inertia formulas in the analysis of general linear models
  15. Regular Articles
  16. The hybrid power mean of quartic Gauss sums and Kloosterman sums
  17. Regular Articles
  18. Tauberian theorems for statistically (C,1,1) summable double sequences of fuzzy numbers
  19. Regular Articles
  20. Some properties of graded comultiplication modules
  21. Regular Articles
  22. The characterizations of upper approximation operators based on special coverings
  23. Regular Articles
  24. Bi-integrable and tri-integrable couplings of a soliton hierarchy associated with SO(4)
  25. Regular Articles
  26. Dynamics for a discrete competition and cooperation model of two enterprises with multiple delays and feedback controls
  27. Regular Articles
  28. A new view of relationship between atomic posets and complete (algebraic) lattices
  29. Regular Articles
  30. A class of extensions of Restricted (s, t)-Wythoff’s game
  31. Regular Articles
  32. New bounds for the minimum eigenvalue of 𝓜-tensors
  33. Regular Articles
  34. Shintani and Shimura lifts of cusp forms on certain arithmetic groups and their applications
  35. Regular Articles
  36. Empirical likelihood for quantile regression models with response data missing at random
  37. Regular Articles
  38. Convex combination of analytic functions
  39. Regular Articles
  40. On the Yang-Baxter-like matrix equation for rank-two matrices
  41. Regular Articles
  42. Uniform topology on EQ-algebras
  43. Regular Articles
  44. Integrations on rings
  45. Regular Articles
  46. The quasilinear parabolic kirchhoff equation
  47. Regular Articles
  48. Avoiding rainbow 2-connected subgraphs
  49. Regular Articles
  50. On non-Hopfian groups of fractions
  51. Regular Articles
  52. Singularly perturbed hyperbolic problems on metric graphs: asymptotics of solutions
  53. Regular Articles
  54. Rings in which elements are the sum of a nilpotent and a root of a fixed polynomial that commute
  55. Regular Articles
  56. Superstability of functional equations related to spherical functions
  57. Regular Articles
  58. Evaluation of the convolution sum involving the sum of divisors function for 22, 44 and 52
  59. Regular Articles
  60. Weighted minimal translation surfaces in the Galilean space with density
  61. Regular Articles
  62. Complete convergence for weighted sums of pairwise independent random variables
  63. Regular Articles
  64. Binomials transformation formulae for scaled Fibonacci numbers
  65. Regular Articles
  66. Growth functions for some uniformly amenable groups
  67. Regular Articles
  68. Hopf bifurcations in a three-species food chain system with multiple delays
  69. Regular Articles
  70. Oscillation and nonoscillation of half-linear Euler type differential equations with different periodic coefficients
  71. Regular Articles
  72. Osculating curves in 4-dimensional semi-Euclidean space with index 2
  73. Regular Articles
  74. Some new facts about group 𝒢 generated by the family of convergent permutations
  75. Regular Articles
  76. lnfinitely many solutions for fractional Schrödinger equations with perturbation via variational methods
  77. Regular Articles
  78. Supersolvable orders and inductively free arrangements
  79. Regular Articles
  80. Asymptotically almost automorphic solutions of differential equations with piecewise constant argument
  81. Regular Articles
  82. Finite groups whose all second maximal subgroups are cyclic
  83. Regular Articles
  84. Semilinear systems with a multi-valued nonlinear term
  85. Regular Articles
  86. Positive solutions for Hadamard differential systems with fractional integral conditions on an unbounded domain
  87. Regular Articles
  88. Calibration and simulation of Heston model
  89. Regular Articles
  90. One kind sixth power mean of the three-term exponential sums
  91. Regular Articles
  92. Cyclic pairs and common best proximity points in uniformly convex Banach spaces
  93. Regular Articles
  94. The uniqueness of meromorphic functions in k-punctured complex plane
  95. Regular Articles
  96. Normalizers of intermediate congruence subgroups of the Hecke subgroups
  97. Regular Articles
  98. The hyperbolicity constant of infinite circulant graphs
  99. Regular Articles
  100. Scott convergence and fuzzy Scott topology on L-posets
  101. Regular Articles
  102. One sided strong laws for random variables with infinite mean
  103. Regular Articles
  104. The join of split graphs whose completely regular endomorphisms form a monoid
  105. Regular Articles
  106. A new branch and bound algorithm for minimax ratios problems
  107. Regular Articles
  108. Upper bound estimate of incomplete Cochrane sum
  109. Regular Articles
  110. Value distributions of solutions to complex linear differential equations in angular domains
  111. Regular Articles
  112. The nonlinear diffusion equation of the ideal barotropic gas through a porous medium
  113. Regular Articles
  114. The Sheffer stroke operation reducts of basic algebras
  115. Regular Articles
  116. Extensions and improvements of Sherman’s and related inequalities for n-convex functions
  117. Regular Articles
  118. Classification lattices are geometric for complete atomistic lattices
  119. Regular Articles
  120. Possible numbers of x’s in an {x, y}-matrix with a given rank
  121. Regular Articles
  122. New error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices
  123. Regular Articles
  124. Boundedness of vector-valued B-singular integral operators in Lebesgue spaces
  125. Regular Articles
  126. On the Golomb’s conjecture and Lehmer’s numbers
  127. Regular Articles
  128. Some applications of the Archimedean copulas in the proof of the almost sure central limit theorem for ordinary maxima
  129. Regular Articles
  130. Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  131. Regular Articles
  132. Corrigendum to: Dual-stage adaptive finite-time modified function projective multi-lag combined synchronization for multiple uncertain chaotic systems
  133. Regular Articles
  134. Convergence and stability of generalized φ-weak contraction mapping in CAT(0) spaces
  135. Regular Articles
  136. Triple solutions for a Dirichlet boundary value problem involving a perturbed discrete p(k)-Laplacian operator
  137. Regular Articles
  138. OD-characterization of alternating groups Ap+d
  139. Regular Articles
  140. On Jordan mappings of inverse semirings
  141. Regular Articles
  142. On generalized Ehresmann semigroups
  143. Regular Articles
  144. On topological properties of spaces obtained by the double band matrix
  145. Regular Articles
  146. Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions
  147. Regular Articles
  148. Chain conditions on composite Hurwitz series rings
  149. Regular Articles
  150. Coloring subgraphs with restricted amounts of hues
  151. Regular Articles
  152. An extension of the method of brackets. Part 1
  153. Regular Articles
  154. Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
  155. Regular Articles
  156. Strong edge geodetic problem in networks
  157. Regular Articles
  158. Ricci solitons on almost Kenmotsu 3-manifolds
  159. Regular Articles
  160. Uniqueness of meromorphic functions sharing two finite sets
  161. Regular Articles
  162. On the fourth-order linear recurrence formula related to classical Gauss sums
  163. Regular Articles
  164. Dynamical behavior for a stochastic two-species competitive model
  165. Regular Articles
  166. Two new eigenvalue localization sets for tensors and theirs applications
  167. Regular Articles
  168. κ-strong sequences and the existence of generalized independent families
  169. Regular Articles
  170. Commutators of Littlewood-Paley gκ -functions on non-homogeneous metric measure spaces
  171. Regular Articles
  172. On decompositions of estimators under a general linear model with partial parameter restrictions
  173. Regular Articles
  174. Groups and monoids of Pythagorean triples connected to conics
  175. Regular Articles
  176. Hom-Lie superalgebra structures on exceptional simple Lie superalgebras of vector fields
  177. Regular Articles
  178. Numerical methods for the multiplicative partial differential equations
  179. Regular Articles
  180. Solvable Leibniz algebras with NFn Fm1 nilradical
  181. Regular Articles
  182. Evaluation of the convolution sums ∑al+bm=n lσ(l) σ(m) with ab ≤ 9
  183. Regular Articles
  184. A study on soft rough semigroups and corresponding decision making applications
  185. Regular Articles
  186. Some new inequalities of Hermite-Hadamard type for s-convex functions with applications
  187. Regular Articles
  188. Deficiency of forests
  189. Regular Articles
  190. Perfect codes in power graphs of finite groups
  191. Regular Articles
  192. A new compact finite difference quasilinearization method for nonlinear evolution partial differential equations
  193. Regular Articles
  194. Does any convex quadrilateral have circumscribed ellipses?
  195. Regular Articles
  196. The dynamic of a Lie group endomorphism
  197. Regular Articles
  198. On pairs of equations in unlike powers of primes and powers of 2
  199. Regular Articles
  200. Differential subordination and convexity criteria of integral operators
  201. Regular Articles
  202. Quantitative relations between short intervals and exceptional sets of cubic Waring-Goldbach problem
  203. Regular Articles
  204. On θ-commutators and the corresponding non-commuting graphs
  205. Regular Articles
  206. Quasi-maximum likelihood estimator of Laplace (1, 1) for GARCH models
  207. Regular Articles
  208. Multiple and sign-changing solutions for discrete Robin boundary value problem with parameter dependence
  209. Regular Articles
  210. Fundamental relation on m-idempotent hyperrings
  211. Regular Articles
  212. A novel recursive method to reconstruct multivariate functions on the unit cube
  213. Regular Articles
  214. Nabla inequalities and permanence for a logistic integrodifferential equation on time scales
  215. Regular Articles
  216. Enumeration of spanning trees in the sequence of Dürer graphs
  217. Regular Articles
  218. Quotient of information matrices in comparison of linear experiments for quadratic estimation
  219. Regular Articles
  220. Fourier series of functions involving higher-order ordered Bell polynomials
  221. Regular Articles
  222. Simple modules over Auslander regular rings
  223. Regular Articles
  224. Weighted multilinear p-adic Hardy operators and commutators
  225. Regular Articles
  226. Guaranteed cost finite-time control of positive switched nonlinear systems with D-perturbation
  227. Regular Articles
  228. A modified quasi-boundary value method for an abstract ill-posed biparabolic problem
  229. Regular Articles
  230. Extended Riemann-Liouville type fractional derivative operator with applications
  231. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  232. The algebraic size of the family of injective operators
  233. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  234. The history of a general criterium on spaceability
  235. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  236. On sequences not enjoying Schur’s property
  237. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  238. A hierarchy in the family of real surjective functions
  239. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  240. Dynamics of multivalued linear operators
  241. Topical Issue on Topological and Algebraic Genericity in Infinite Dimensional Spaces
  242. Linear dynamics of semigroups generated by differential operators
  243. Special Issue on Recent Developments in Differential Equations
  244. Isomorphism theorems for some parabolic initial-boundary value problems in Hörmander spaces
  245. Special Issue on Recent Developments in Differential Equations
  246. Determination of a diffusion coefficient in a quasilinear parabolic equation
  247. Special Issue on Recent Developments in Differential Equations
  248. Homogeneous two-point problem for PDE of the second order in time variable and infinite order in spatial variables
  249. Special Issue on Recent Developments in Differential Equations
  250. A nonlinear plate control without linearization
  251. Special Issue on Recent Developments in Differential Equations
  252. Reduction of a Schwartz-type boundary value problem for biharmonic monogenic functions to Fredholm integral equations
  253. Special Issue on Recent Developments in Differential Equations
  254. Inverse problem for a physiologically structured population model with variable-effort harvesting
  255. Special Issue on Recent Developments in Differential Equations
  256. Existence of solutions for delay evolution equations with nonlocal conditions
  257. Special Issue on Recent Developments in Differential Equations
  258. Comments on behaviour of solutions of elliptic quasi-linear problems in a neighbourhood of boundary singularities
  259. Special Issue on Recent Developments in Differential Equations
  260. Coupled fixed point theorems in complete metric spaces endowed with a directed graph and application
  261. Special Issue on Recent Developments in Differential Equations
  262. Existence of entropy solutions for nonlinear elliptic degenerate anisotropic equations
  263. Special Issue on Recent Developments in Differential Equations
  264. Integro-differential systems with variable exponents of nonlinearity
  265. Special Issue on Recent Developments in Differential Equations
  266. Elliptic operators on refined Sobolev scales on vector bundles
  267. Special Issue on Recent Developments in Differential Equations
  268. Multiplicity solutions of a class fractional Schrödinger equations
  269. Special Issue on Recent Developments in Differential Equations
  270. Determining of right-hand side of higher order ultraparabolic equation
  271. Special Issue on Recent Developments in Differential Equations
  272. Asymptotic approximation for the solution to a semi-linear elliptic problem in a thin aneurysm-type domain
  273. Topical Issue on Metaheuristics - Methods and Applications
  274. Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
  275. Topical Issue on Metaheuristics - Methods and Applications
  276. Nature–inspired metaheuristic algorithms to find near–OGR sequences for WDM channel allocation and their performance comparison
  277. Topical Issue on Cyber-security Mathematics
  278. Monomial codes seen as invariant subspaces
  279. Topical Issue on Cyber-security Mathematics
  280. Expert knowledge and data analysis for detecting advanced persistent threats
  281. Topical Issue on Cyber-security Mathematics
  282. Feedback equivalence of convolutional codes over finite rings
Downloaded on 17.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2017-0136/html
Scroll to top button