Home Double domination in maximal outerplanar graphs
Article Open Access

Double domination in maximal outerplanar graphs

  • Wei Zhuang EMAIL logo and Qiuju Zheng
Published/Copyright: October 6, 2022

Abstract

In graph G , a vertex dominates itself and its neighbors. A subset S V ( G ) is said to be a double-dominating set of G if S dominates every vertex of G at least twice. The double domination number γ × 2 ( G ) is the minimum cardinality of a double dominating set of G . We show that if G is a maximal outerplanar graph on n 3 vertices, then γ × 2 ( G ) 2 n 3 . Further, if n 4 , then γ × 2 ( G ) min n + t 2 , n t , where t is the number of vertices of degree 2 in G . These bounds are shown to be tight. In addition, we also study the case that G is a striped maximal outerplanar graph.

MSC 2010: 05C69

1 Introduction

For a simple graph G = ( V , E ) , V and E are the sets of vertices and edges of G , respectively. We denote by V ( G ) the order of a graph G . If the graph G is clear from the context, we simply write G or n rather than V ( G ) . For a vertex v V ( G ) , let N G ( v ) and N G [ v ] denote the open neighborhood and the closed neighborhood of v , respectively; thus, N G ( v ) = { u u v E ( G ) } and N G [ v ] = { v } N G ( v ) . A graph G is outerplanar if it can be embedded in the plane such that all vertices belong to the boundary of its outer face. An outerplanar graph G is maximal if G + u v is not outerplanar for any two nonadjacent vertices u and v .

A dominating set of a graph G is a set S V ( G ) such that every vertex in G is either in S or is adjacent to a vertex in S . A set D V ( G ) is a double dominating set of G if every vertex in V ( G ) D has at least two neighbors in D and every vertex of D has a neighbor in D . The domination number (double domination number, respectively) of G , denoted by γ ( G ) ( γ × 2 ( G ) , respectively), is the minimum cardinality of a dominating set (double dominating set, respectively). A double dominating set of G of cardinality γ × 2 ( G ) is called a γ × 2 ( G ) -set. If the graph G is clear from the context, we simply write γ × 2 -set rather than γ × 2 ( G ) -set. We say a vertex v in G is double dominated, by a set S , if N G [ v ] S 2 .

The concept of double domination was introduced by Harary and Haynes [1] and further studied in, for example, [2,3, 4,5,6, 7,8].

In 1996, Matheson and Tarjan [9] proved that any triangulated disc G with n vertices satisfies γ ( G ) n 3 , and conjectured that γ ( G ) n 4 for every n -vertex triangulation G with sufficiently large n . In 2013, Campos and Wakabayashi investigated this problem for maximal outerplanar graphs and showed in [10] that if G is a maximal outerplanar graph of order n , then γ ( G ) n + k 4 , where k is the number of vertices of degree 2 in G . Tokunaga proved the same result independently in [11]. Li et al. [12] improved the result by showing that γ ( G ) n + t 4 , where t is the number of pairs of consecutive 2-degree vertices with distance at least 3 on the outer cycle. For results on other types of domination in maximal outerplanar graphs, we refer the reader to [13,14,15, 16,17,18, 19,20].

In this article, we apply the idea of coloring to investigate the same question for double domination. We show that if G is a maximal outerplanar graph on n 3 vertices, then γ × 2 ( G ) 2 n 3 . Further, if n 4 , then γ × 2 ( G ) min n + t 2 , n t , where t is the number of vertices of degree 2 in G . These bounds are shown to be tight. In addition, we also study the case that G is a striped maximal outerplanar graph.

2 Preliminaries

A maximal outerplanar graph G can be embedded in the plane such that the boundary of the outer face is a Hamiltonian cycle and each inner face is a triangle. A maximal outerplanar graph embedded in the plane is called a maximal outerplane graph. For such an embedding of G , we denote by H G the Hamiltonian cycle which is the boundary of the outer face. An inner face of a maximal outerplane graph G is an internal triangle if it is not adjacent to outer face. A maximal outerplane graph without internal triangles is called striped. The following results are useful for our study.

Proposition 2.1

[10] Let G be a maximal outerplanar graph of order n 4 . If G has k internal triangles, then G has k + 2 vertices of degree 2.

From Proposition 2.1, we know that every maximal outerplanar graph has at least two vertices of degree two.

Proposition 2.2

[12] Let G be a striped maximal outerplanar graph of order n > 4 ; then for any vertex v V ( G ) of degree 2, the degrees of two neighbors of v are 3 and p ( p 4 ).

Proposition 2.3

If G is a maximal outerplanar graph of order n 4 , then G is striped if and only if G has exactly two vertices of degree two.

Proof

Suppose that G is a maximal outerplanar graph with minimum order that satisfy the two properties:

  1. G has exactly two vertices of degree two.

  2. G has at least one internal triangle.

Clearly, G 6 . Let u be a vertex of degree two in G , and v , y be its neighbors. By Proposition 2.2, one of the two neighbors, say v , has degree three. Now, we remove u and denote the resulting graph by G 1 . It is easy to see that G 1 is still a maximal outerplanar graph. Moreover, G 1 has exactly two vertices of degree two, and one of them is v (see Figure 1). Assume that C is an internal triangle of G . From the assumption of the graph G , C is not an internal triangle of G 1 . It implies that v y is an edge of C . Then, v x is also an edge of C , where x is the remaining neighbor of v in G other than u and y . It contradicts the assumption that C is an internal triangle of G .

On the other hand, from Proposition 2.1, we know that a striped maximal outerplanar graph has exactly two vertices of degree two.

The result holds.□

Figure 1 
               
                  
                     
                        
                        
                           G
                        
                        G
                     
                   and 
                     
                        
                        
                           
                              
                                 G
                              
                              
                                 1
                              
                           
                        
                        {G}_{1}
                     
                  .
Figure 1

G and G 1 .

Proposition 2.4

[15] If G is a maximal outerplanar graph of order n 4 , then the set of vertices of G of degree 2 is an independent set of G of size at most n 2 .

Proposition 2.5

[1] Let C be a cycle of order n 3 , then γ × 2 ( C ) = 2 n 3 .

3 Main result

Let G be any maximal outerplanar graph. We know that there exists a Hamiltonian cycle in G , say H G . It is easy to see that a γ × 2 -set of H G is a double dominating set of G . Hence, the following result is immediate from Proposition 2.5.

Observation 3.1

Let G be a maximal outerplanar graph of order n 3 , then γ × 2 ( G ) 2 n 3 .

This conclusion is obvious, so we are ready to improve it. Next, we will give some definitions that are helpful for our investigations.

A minor of a graph G is a graph that can be obtained from G by deleting vertices and deleting or contracting edges. Given a graph H , a graph G is H-minor free if no minor of G is isomorphic to H . A K 4 -minor free graph G is maximal if G + u v is not a K 4 -minor free graph for any two nonadjacent vertices u and v of G . A 2-tree is defined recursively as follows. A single edge is a 2-tree. Any graph obtained from a 2-tree by adding a new vertex and making it adjacent to the end vertices of an existing edge is also a 2-tree. It is well known that the maximal K 4 -minor-free graphs are exactly the 2-trees. We know that a maximal outerplanar graph must be a maximal K 4 -minor free graph. Hence, before giving the upper bound for the double domination number of a maximal outerplanar graph, we intend to prove the stronger result as follows.

Theorem 3.2

Let G be a maximal K 4 -minor free graph of order n 3 , then γ × 2 ( G ) 2 n 3 .

Proof

Let G i = G i 1 v i for i = 1 , 2 , , n 3 , where v i is a vertex of degree 2 in G i 1 , G 0 = G . Since a maximal K 4 -minor free graph is exactly a 2-tree and according to the definition of 2-tree, we have that G n 3 is a K 3 . We can give a proper 3-coloring to G 0 by assigning colors 1, 2, and 3 to the three vertices of G n 3 and color v i with the remaining color, which does not appear in N G i 1 ( v i ) at each stage. Let V t be the set of vertices assigned color t , where t = 1 , 2 , 3 . Choosing two suitable color classes, say V 1 and V 2 , such that V 1 + V 2 2 3 G 0 . Let S = V 1 V 2 . Next, we will show that S is a double dominating set of G .

Clearly, each of the three vertices is double dominated by S V ( G n 3 ) in G n 3 . In V ( G i 1 ) ( i = n 3 , n 4 , , 2 , 1 ), N G i 1 [ v i ] ( S V ( G i 1 ) ) = 2 . It means that each vertex of G is double dominated by S .□

On the basis of the aforementioned theorem, we have the following conclusion.

Corollary 3.3

Let G be a maximal outerplanar graph of order n 3 , then γ × 2 ( G ) 2 n 3 .

To show that this bound is tight. We are ready to construct an infinite family of graphs as follows. Let H be any maximal outerplanar graph with 2 k vertices, and C = a 1 a 2 a 2 k 1 a 2 k a 1 is the unique Hamiltonian cycle of H . We note that C is the boundary of the outer face of H . Let G H be the graph obtained from H by adding k new vertices u 1 , u 2 , , u k and 2 k new edges u 1 a 1 , u 1 a 2 , u 2 a 3 , u 2 a 4 , , u k a 2 k 1 , u k a 2 k (see Figure 2, the nontriangular face can be triangulated in any way so as to obtain a maximal outerplanar graph). Let U be a family consisting of all such graph G H . Take a γ × 2 -set of G H , say S . Let v be a vertex of degree two in G H , it is easy to see that N G H [ v ] S 2 . It means that S 2 k = 2 G H 3 . On the other hand, it follows from Corollary 3.3 that S 2 G H 3 . Hence, γ × 2 ( G H ) = 2 G H 3 .

Figure 2 
               The graph 
                     
                        
                        
                           H
                        
                        H
                     
                  .
Figure 2

The graph H .

But the result of Corollary 3.3 is still not good enough, it only slightly improves Observation 3.1, so we hope to further improve the result of Corollary 3.3. Next, we will give two upper bounds in terms of the order and the number of 2-degree vertices, and the first one is inspired by [11].

Lemma 3.4

[11] A maximal outerplanar graph G can be four colored such that every cycle of length 4 in G has all four colors.

Theorem 3.5

Let G be a maximal outerplanar graph of order n 3 . If t is the number of vertices of degree 2 in G , then γ × 2 ( G ) n + t 2 .

Proof

Let R = { a 1 , a 2 , , a t } be the set of vertices of G having degree 2. For each a i , let b i be one of its neighbors ( b s and b t are not necessarily distinct when s t ). We construct a graph G from G by adding t new vertices u 1 , u 2 , , u t , and 2 t new edges a 1 u 1 , b 1 u 1 , a 2 u 2 , b 2 u 2 , , a t u t , b t u t . Note that G is also a maximal outerplanar graph. By Lemma 3.4, G can be four colored such that every cycle of length 4 in G has all four colors. Let V p be the set of vertices assigned color p , where p = 1 , 2 , 3 , 4 . Choosing two suitable color classes, say V 1 and V 2 , such that V 1 + V 2 n + t 2 . Let D = V 1 V 2 .

Let D { u 1 , u 2 , , u t } = { u 1 , u 2 , , u k } , where k t . For any u i , at least one of its neighbors, say v i { a i , b i } , does not belong to D . We construct a new set D = ( D { u 1 , u 2 , , u k } ) { v 1 , v 2 , , v k } .

Now, let x be a vertex of G of degree at least 3, and x 1 , x 2 , and x 3 be consecutive vertices of N G ( x ) in this order. Clearly, x x 1 x 2 x 3 forms a cycle of length 4, and two of { x , x 1 , x 2 , x 3 } belong to D . Since every vertex in { x , x 1 , x 2 , x 3 } , except possibly one, has degree at least three, we have that at least two of those vertices of degree at least three belong to D . It means that x is double dominated by D . Then, D is a double dominating set of G .□

On the other hand, for a maximal outerplanar graph G of order at least four, of all vertices of G of degree, at least three form a double dominating set of G . Hence, we have the following conclusion.

Observation 3.6

Let G be a maximal outerplanar graph of order n 4 . If t is the number of vertices of degree 2 in G , then γ × 2 ( G ) n t .

Clearly, each graph of U achieves equalities in Theorem 3.5 and Observation 3.6. That is, the bounds of Theorem 3.5 and Observation 3.6 are also tight. The following conclusion is immediate from Theorem 3.5 and Observation 3.6.

Corollary 3.7

Let G be a maximal outerplanar graph of order n 4 . If t is the number of vertices of degree 2 in G , then

γ × 2 ( G ) n + t 2 , if t < n 3 ; n t , otherwise .

Next, we compare the bound in Corollary 3.3 with that in Corollary 3.7. From Proposition 2.4, we know that there are at most n 2 vertices of degree 2 in a maximal outerplanar graph. It is easy to see that n + t 2 < 2 n 3 when t < n 3 , and n t < 2 n 3 when n 3 < t n 2 . Thus, the bound in Corollary 3.7 is better than that in Corollary 3.3.

Based on the aforementioned analysis, it is natural to consider the following question: Can the upper bound for Corollary 3.7 be improved for the striped maximal outerplanar graph? From the aforementioned result, we know that n + t 2 < n t when t is far less than n . Then combining Proposition 2.1, we have the following result.

Corollary 3.8

Let G be a striped maximal outerplanar graph with n 3 vertices. Then, γ × 2 ( G ) n 2 + 1 .

Next, we construct a striped maximal outerplanar graph G of order n 6 . Let C = a 1 a 2 a q 1 a q b q b q 1 b 2 b 1 a 1 is the unique Hamiltonian cycle of G , where q 1 ( mod 4 ) or q 3 ( mod 4 ) . We know that C is the boundary of the outer face of G . Let E 1 = { a 2 b 2 , a 3 b 3 , , a q 1 b q 1 } , E ( G ) = E ( C ) E 1 { a 1 b 2 , a 2 b 3 , a 4 b 3 , a 5 b 4 , a 5 b 6 , a 6 b 7 , a 8 b 7 , a 9 b 8 , , a q 4 b q 3 , a q 3 b q 2 , a q 1 b q 2 , a q b q 1 } , when q 1 ( mod 4 ) and E ( G ) = E ( C ) E 1 { a 1 b 2 , a 2 b 3 , a 4 b 3 , a 5 b 4 , a 5 b 6 , a 6 b 7 , a 8 b 7 , a 9 b 8 , , a q 3 b q 4 , a q 2 b q 3 , a q 2 b q 1 , a q 1 b q } , when q 3 ( mod 4 ) (see Figure 3). Note that G 2 ( mod 4 ) . Let A be a family consisting of all such graph G . We will show that each graph of A attains the bound of Corollary 3.8.

Figure 3 
               The graph 
                     
                        
                        
                           G
                        
                        G
                     
                  . (a) 
                     
                        
                        
                           q
                           ≡
                           1
                           
                           
                              (
                              
                                 
                                    mod
                                 
                                 
                                 4
                              
                              )
                           
                        
                        q\equiv 1\hspace{0.3em}\left(\mathrm{mod}\hspace{0.3em}4)
                     
                  . (b) 
                     
                        
                        
                           q
                           ≡
                           3
                           
                           
                              (
                              
                                 
                                    mod
                                 
                                 
                                 4
                              
                              )
                           
                        
                        q\equiv 3\hspace{0.3em}\left(\mathrm{mod}\hspace{0.3em}4)
                     
                  .
Figure 3

The graph G . (a) q 1 ( mod 4 ) . (b) q 3 ( mod 4 ) .

Theorem 3.9

If a striped maximal outerplanar graph G belongs to A , then γ × 2 ( G ) = G 2 + 1 .

Proof

If G = 6 , the result holds. This establishes the base case. So we let G 10 . (Note that G 2 ( mod 4 ) .) Assume that G is a striped maximal outerplanar graph of A with minimum order, such that γ × 2 ( G ) < G 2 + 1 .

Let C = a 1 a 2 a q 1 a q b q b q 1 b 2 b 1 a 1 be the unique Hamiltonian cycle of G , and S be a γ × 2 -set of G . It follows from Proposition 2.1 that G has exactly two vertices of degree two, without loss of generality, suppose that a q is one of them. Clearly, N [ a q ] S 2 , and S 1 = ( S N [ a q ] ) { a q 1 , b q } is still a γ × 2 -set of G . Moreover, N [ b q 2 ] S 1 2 , and S 2 = ( S 1 N [ b q 2 ] ) { a q 2 , b q 3 } is also a γ × 2 -set of G .

Let G = G { a q 1 , b q 1 , a q , b q } (see Figure 4). Note that G is also a striped maximal outerplanar graph, which belongs to A , and S 2 { a q 1 , b q } is a double dominating set of G . Thus, γ × 2 ( G ) γ × 2 ( G ) 2 < G 2 1 = G + 4 2 1 = G 2 + 1 . It contradicts the assumption that γ × 2 ( G ) = G 2 + 1 .□

Figure 4 
               The graphs 
                     
                        
                        
                           G
                        
                        G
                     
                   and 
                     
                        
                        
                           G
                           ′
                        
                        G^{\prime} 
                     
                  .
Figure 4

The graphs G and G .

From the aforementioned result, we know that Corollary 3.8 is tight for striped maximal outerplanar graphs.

Acknowledgements

The authors would like to thank the referees for many helpful comments and suggestions.

  1. Funding information: This work was supported by Natural Science Foundation of Fujian Province (No. 2015J05017).

  2. Author contributions: All authors have accepted responsibility for the entire content of this manuscript and approved its submission.

  3. Conflict of interest: The authors state no conflict of interest.

  4. Data availability statement: Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.

References

[1] F. Harary and T. W. Haynes, Double domination in graphs, Ars Combin. 55 (2000), 201–213. Search in Google Scholar

[2] M. Blidia, M. Chellali, T. W. Haynes, and M. A. Henning, Independent and double domination in trees, Util. Math. 70 (2006), 159–173. Search in Google Scholar

[3] M. Chellali, A note on the double domination number in trees, AKCE Int. J. Graphs Comb. 3 (2006), 147–150, https://doi.org/10.1080/09728600.2006.12088812. Search in Google Scholar

[4] M. Chellali and T. Haynes, On paired and double domination in graphs, Util. Math. 67 (2005), 161–171. Search in Google Scholar

[5] M. Hajian and N. J. Rad, A new lower bound on the double domination number of a graph, Discrete Appl. Math. 254 (2019), 280–282, https://doi.org/10.1016/j.dam.2018.06.009. Search in Google Scholar

[6] J. Harant and M. A. Henning, On double domination in graphs, Discuss. Math. Graph Theory 25 (2005), no. 1–2, 29–34, https://doi.org/10.7151/dmgt.1256. Search in Google Scholar

[7] P. Kaemawichanurat, Hamiltonicities of double dominationcritical and stable claw-free graphs, Discuss. Math. Graph T. 198 (2016), no. 3, 164–169, https://doi.org/10.7151/dmgt.2148. Search in Google Scholar

[8] A. C. Martínez, S. C. García, and J. A. Rodríguez-Velázquez, Double domination in lexicographic product graphs, Discrete Appl. Math. 284 (2020), 290–300, https://doi.org/10.1016/j.dam.2020.03.045. Search in Google Scholar

[9] L. R. Matheson and R. E. Tarjan, Dominating sets in planar graphs, European J. Combin. 17 (1996), no. 6, 565–568, https://doi.org/10.1006/eujc.1996.0048. Search in Google Scholar

[10] C. N. Campos and Y. Wakabayashi, On dominating sets of maximal outerplanar graphs, Discrete Appl. Math. 161 (2013), 330–335, https://doi.org/10.1016/j.dam.2012.08.023. Search in Google Scholar

[11] S. Tokunaga, Dominating sets of maximal outerplanar graphs, Discrete Appl. Math. 161 (2013), 3097–3099, https://doi.org/10.1016/j.dam.2013.06.025. Search in Google Scholar

[12] Z. P. Li, E. Q. Zhu, Z. H. Shao, and J. Xu, On dominating sets of maximal outerplanar and planar graphs, Discrete Appl. Math. 198 (2016), 164–169, https://doi.org/10.1016/j.dam.2015.06.024. Search in Google Scholar

[13] T. Araki and I. Yumoto, On the secure domination numbers of maximal outerplanar graphs, Discrete Appl. Math. 236 (2018), 23–29, DOI: https://doi.org/10.1016/ j.dam.2017.10.020. 10.1016/j.dam.2017.10.020Search in Google Scholar

[14] P. Borg and P. Kaemawichanurat, Partial domination of maximal outerplanar graphs, Discrete Appl. Math. 283 (2020), 306–314, https://doi.org/10.1016/j.dam.2020.01.005. Search in Google Scholar

[15] M. Dorfling and E. Jonck, Total domination in maximal outerplanar graphs, Discrete Appl. Math. 217 (2017), 506–511, https://doi.org/10.1016/j.dam.2016.10.020. Search in Google Scholar

[16] M. Dorfling, J. H. Hattingh, and E. Jonck, Totaldomination in maximal outerplanar graphs II, Discrete Math. 339 (2016), no. 3, 1180–1188, https://doi.org/10.1016/j.disc.2015.11.003. Search in Google Scholar

[17] M.A. Henning and P. Kaemawichanurat, Semipaired domination in maximal outerplanar graphs, J. Comb. Optim. 38 (2019), no. 3, 911–926, https://doi.org/10.1007/s10878-019-00427-9. Search in Google Scholar

[18] M. Lemańska, R. Zuazua, and P. Żyliński, Total dominating sets in maximal outerplanar graphs, Graphs Combin. 33 (2017), no. 4, 991–998, https://doi.org/10.1007/s00373-017-1802-7. Search in Google Scholar

[19] S. Tokunaga, T. Jiarasuksakun, and P. Kaemawichanurat, Isolation number of maximal outerplanar graphs, Discrete Appl. Math. 267 (2019), 215–218, https://doi.org/10.1016/j.dam.2019.06.011. Search in Google Scholar

[20] T. T. Zhu and B. Wu, Domination of maximal K4-minor free graphs and maximal K2,3 -minor free graphs, and disproofs of two conjectures on planar graphs, Discrete Appl. Math. 194 (2015), 147–153, DOI: https://doi.org/10.1016/j.dam.2015.05.029. 10.1016/j.dam.2015.05.029Search in Google Scholar

Received: 2022-02-20
Revised: 2022-06-08
Accepted: 2022-08-09
Published Online: 2022-10-06

© 2022 Wei Zhuang and Qiuju Zheng, published by De Gruyter

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

Articles in the same Issue

  1. Regular Articles
  2. A random von Neumann theorem for uniformly distributed sequences of partitions
  3. Note on structural properties of graphs
  4. Mean-field formulation for mean-variance asset-liability management with cash flow under an uncertain exit time
  5. The family of random attractors for nonautonomous stochastic higher-order Kirchhoff equations with variable coefficients
  6. The intersection graph of graded submodules of a graded module
  7. Isoperimetric and Brunn-Minkowski inequalities for the (p, q)-mixed geominimal surface areas
  8. On second-order fuzzy discrete population model
  9. On certain functional equation in prime rings
  10. General complex Lp projection bodies and complex Lp mixed projection bodies
  11. Some results on the total proper k-connection number
  12. The stability with general decay rate of hybrid stochastic fractional differential equations driven by Lévy noise with impulsive effects
  13. Well posedness of magnetohydrodynamic equations in 3D mixed-norm Lebesgue space
  14. Strong convergence of a self-adaptive inertial Tseng's extragradient method for pseudomonotone variational inequalities and fixed point problems
  15. Generic uniqueness of saddle point for two-person zero-sum differential games
  16. Relational representations of algebraic lattices and their applications
  17. Explicit construction of mock modular forms from weakly holomorphic Hecke eigenforms
  18. The equivalent condition of G-asymptotic tracking property and G-Lipschitz tracking property
  19. Arithmetic convolution sums derived from eta quotients related to divisors of 6
  20. Dynamical behaviors of a k-order fuzzy difference equation
  21. The transfer ideal under the action of orthogonal group in modular case
  22. The multinomial convolution sum of a generalized divisor function
  23. Extensions of Gronwall-Bellman type integral inequalities with two independent variables
  24. Unicity of meromorphic functions concerning differences and small functions
  25. Solutions to problems about potentially Ks,t-bigraphic pair
  26. Monotonicity of solutions for fractional p-equations with a gradient term
  27. Data smoothing with applications to edge detection
  28. An ℋ-tensor-based criteria for testing the positive definiteness of multivariate homogeneous forms
  29. Characterizations of *-antiderivable mappings on operator algebras
  30. Initial-boundary value problem of fifth-order Korteweg-de Vries equation posed on half line with nonlinear boundary values
  31. On a more accurate half-discrete Hilbert-type inequality involving hyperbolic functions
  32. On split twisted inner derivation triple systems with no restrictions on their 0-root spaces
  33. Geometry of conformal η-Ricci solitons and conformal η-Ricci almost solitons on paracontact geometry
  34. Bifurcation and chaos in a discrete predator-prey system of Leslie type with Michaelis-Menten prey harvesting
  35. A posteriori error estimates of characteristic mixed finite elements for convection-diffusion control problems
  36. Dynamical analysis of a Lotka Volterra commensalism model with additive Allee effect
  37. An efficient finite element method based on dimension reduction scheme for a fourth-order Steklov eigenvalue problem
  38. Connectivity with respect to α-discrete closure operators
  39. Khasminskii-type theorem for a class of stochastic functional differential equations
  40. On some new Hermite-Hadamard and Ostrowski type inequalities for s-convex functions in (p, q)-calculus with applications
  41. New properties for the Ramanujan R-function
  42. Shooting method in the application of boundary value problems for differential equations with sign-changing weight function
  43. Ground state solution for some new Kirchhoff-type equations with Hartree-type nonlinearities and critical or supercritical growth
  44. Existence and uniqueness of solutions for the stochastic Volterra-Levin equation with variable delays
  45. Ambrosetti-Prodi-type results for a class of difference equations with nonlinearities indefinite in sign
  46. Research of cooperation strategy of government-enterprise digital transformation based on differential game
  47. Malmquist-type theorems on some complex differential-difference equations
  48. Disjoint diskcyclicity of weighted shifts
  49. Construction of special soliton solutions to the stochastic Riccati equation
  50. Remarks on the generalized interpolative contractions and some fixed-point theorems with application
  51. Analysis of a deteriorating system with delayed repair and unreliable repair equipment
  52. On the critical fractional Schrödinger-Kirchhoff-Poisson equations with electromagnetic fields
  53. The exact solutions of generalized Davey-Stewartson equations with arbitrary power nonlinearities using the dynamical system and the first integral methods
  54. Regularity of models associated with Markov jump processes
  55. Multiplicity solutions for a class of p-Laplacian fractional differential equations via variational methods
  56. Minimal period problem for second-order Hamiltonian systems with asymptotically linear nonlinearities
  57. Convergence rate of the modified Levenberg-Marquardt method under Hölderian local error bound
  58. Non-binary quantum codes from constacyclic codes over 𝔽q[u1, u2,…,uk]/⟨ui3 = ui, uiuj = ujui
  59. On the general position number of two classes of graphs
  60. A posteriori regularization method for the two-dimensional inverse heat conduction problem
  61. Orbital stability and Zhukovskiǐ quasi-stability in impulsive dynamical systems
  62. Approximations related to the complete p-elliptic integrals
  63. A note on commutators of strongly singular Calderón-Zygmund operators
  64. Generalized Munn rings
  65. Double domination in maximal outerplanar graphs
  66. Existence and uniqueness of solutions to the norm minimum problem on digraphs
  67. On the p-integrable trajectories of the nonlinear control system described by the Urysohn-type integral equation
  68. Robust estimation for varying coefficient partially functional linear regression models based on exponential squared loss function
  69. Hessian equations of Krylov type on compact Hermitian manifolds
  70. Class fields generated by coordinates of elliptic curves
  71. The lattice of (2, 1)-congruences on a left restriction semigroup
  72. A numerical solution of problem for essentially loaded differential equations with an integro-multipoint condition
  73. On stochastic accelerated gradient with convergence rate
  74. Displacement structure of the DMP inverse
  75. Dependence of eigenvalues of Sturm-Liouville problems on time scales with eigenparameter-dependent boundary conditions
  76. Existence of positive solutions of discrete third-order three-point BVP with sign-changing Green's function
  77. Some new fixed point theorems for nonexpansive-type mappings in geodesic spaces
  78. Generalized 4-connectivity of hierarchical star networks
  79. Spectra and reticulation of semihoops
  80. Stein-Weiss inequality for local mixed radial-angular Morrey spaces
  81. Eigenvalues of transition weight matrix for a family of weighted networks
  82. A modified Tikhonov regularization for unknown source in space fractional diffusion equation
  83. Modular forms of half-integral weight on Γ0(4) with few nonvanishing coefficients modulo
  84. Some estimates for commutators of bilinear pseudo-differential operators
  85. Extension of isometries in real Hilbert spaces
  86. Existence of positive periodic solutions for first-order nonlinear differential equations with multiple time-varying delays
  87. B-Fredholm elements in primitive C*-algebras
  88. Unique solvability for an inverse problem of a nonlinear parabolic PDE with nonlocal integral overdetermination condition
  89. An algebraic semigroup method for discovering maximal frequent itemsets
  90. Class-preserving Coleman automorphisms of some classes of finite groups
  91. Exponential stability of traveling waves for a nonlocal dispersal SIR model with delay
  92. Existence and multiplicity of solutions for second-order Dirichlet problems with nonlinear impulses
  93. The transitivity of primary conjugacy in regular ω-semigroups
  94. Stability estimation of some Markov controlled processes
  95. On nonnil-coherent modules and nonnil-Noetherian modules
  96. N-Tuples of weighted noncommutative Orlicz space and some geometrical properties
  97. The dimension-free estimate for the truncated maximal operator
  98. A human error risk priority number calculation methodology using fuzzy and TOPSIS grey
  99. Compact mappings and s-mappings at subsets
  100. The structural properties of the Gompertz-two-parameter-Lindley distribution and associated inference
  101. A monotone iteration for a nonlinear Euler-Bernoulli beam equation with indefinite weight and Neumann boundary conditions
  102. Delta waves of the isentropic relativistic Euler system coupled with an advection equation for Chaplygin gas
  103. Multiplicity and minimality of periodic solutions to fourth-order super-quadratic difference systems
  104. On the reciprocal sum of the fourth power of Fibonacci numbers
  105. Averaging principle for two-time-scale stochastic differential equations with correlated noise
  106. Phragmén-Lindelöf alternative results and structural stability for Brinkman fluid in porous media in a semi-infinite cylinder
  107. Study on r-truncated degenerate Stirling numbers of the second kind
  108. On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq
  109. Some new characterizations of finite p-nilpotent groups
  110. A Billingsley type theorem for Bowen topological entropy of nonautonomous dynamical systems
  111. F4 and PSp (8, ℂ)-Higgs pairs understood as fixed points of the moduli space of E6-Higgs bundles over a compact Riemann surface
  112. On modules related to McCoy modules
  113. On generalized extragradient implicit method for systems of variational inequalities with constraints of variational inclusion and fixed point problems
  114. Solvability for a nonlocal dispersal model governed by time and space integrals
  115. Finite groups whose maximal subgroups of even order are MSN-groups
  116. Symmetric results of a Hénon-type elliptic system with coupled linear part
  117. On the connection between Sp-almost periodic functions defined on time scales and ℝ
  118. On a class of Harada rings
  119. On regular subgroup functors of finite groups
  120. Fast iterative solutions of Riccati and Lyapunov equations
  121. Weak measure expansivity of C2 dynamics
  122. Admissible congruences on type B semigroups
  123. Generalized fractional Hermite-Hadamard type inclusions for co-ordinated convex interval-valued functions
  124. Inverse eigenvalue problems for rank one perturbations of the Sturm-Liouville operator
  125. Data transmission mechanism of vehicle networking based on fuzzy comprehensive evaluation
  126. Dual uniformities in function spaces over uniform continuity
  127. Review Article
  128. On Hahn-Banach theorem and some of its applications
  129. Rapid Communication
  130. Discussion of foundation of mathematics and quantum theory
  131. Special Issue on Boundary Value Problems and their Applications on Biosciences and Engineering (Part II)
  132. A study of minimax shrinkage estimators dominating the James-Stein estimator under the balanced loss function
  133. Representations by degenerate Daehee polynomials
  134. Multilevel MC method for weak approximation of stochastic differential equation with the exact coupling scheme
  135. Multiple periodic solutions for discrete boundary value problem involving the mean curvature operator
  136. Special Issue on Evolution Equations, Theory and Applications (Part II)
  137. Coupled measure of noncompactness and functional integral equations
  138. Existence results for neutral evolution equations with nonlocal conditions and delay via fractional operator
  139. Global weak solution of 3D-NSE with exponential damping
  140. Special Issue on Fractional Problems with Variable-Order or Variable Exponents (Part I)
  141. Ground state solutions of nonlinear Schrödinger equations involving the fractional p-Laplacian and potential wells
  142. A class of p1(x, ⋅) & p2(x, ⋅)-fractional Kirchhoff-type problem with variable s(x, ⋅)-order and without the Ambrosetti-Rabinowitz condition in ℝN
  143. Jensen-type inequalities for m-convex functions
  144. Special Issue on Problems, Methods and Applications of Nonlinear Analysis (Part III)
  145. The influence of the noise on the exact solutions of a Kuramoto-Sivashinsky equation
  146. Basic inequalities for statistical submanifolds in Golden-like statistical manifolds
  147. Global existence and blow up of the solution for nonlinear Klein-Gordon equation with variable coefficient nonlinear source term
  148. Hopf bifurcation and Turing instability in a diffusive predator-prey model with hunting cooperation
  149. Efficient fixed-point iteration for generalized nonexpansive mappings and its stability in Banach spaces
Downloaded on 17.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2022-0488/html
Scroll to top button