Results 21 to 30 of about 1,519 (103)
Total Domination in Generalized Prisms and a New Domination Invariant
Discussiones Mathematicae Graph Theory, 2021 In this paper we complement recent studies on the total domination of prisms by considering generalized prisms, i.e., Cartesian products of an arbitrary graph and a complete graph.
Tepeh Aleksandra
doaj +1 more source
Open Journal of Mathematical Sciences, 2018 This article presents, effects of fractional order derivative and magnetic field on double convection flow of viscous fluid over a moving vertical plate with constant temperature and general concentration.
Nehad Ali Shah +5 more
semanticscholar +1 more source
Spanning Trees with Disjoint Dominating and 2-Dominating Sets
Discussiones Mathematicae Graph Theory, 2022 In this paper, we provide a structural characterization of graphs having a spanning tree with disjoint dominating and 2-dominating sets.
Miotk Mateusz, Żyliński Paweł
doaj +1 more source
The Slater and Sub-k-Domination Number of a Graph with Applications to Domination and k-Domination
Discussiones Mathematicae Graph Theory, 2020 In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph G, called the sub-k-domination number and denoted subk(G).
Amos David +3 more
doaj +1 more source
A New Upper Bound for the Perfect Italian Domination Number of a Tree
Discussiones Mathematicae Graph Theory, 2022 A perfect Italian dominating function (PIDF) on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that for every vertex u with f(u) = 0, the total weight of f assigned to the neighbors of u is exactly two. The weight of a PIDF is the
Nazari-Moghaddam Sakineh +1 more
doaj +1 more source
Bounds on Domination Parameters in Graphs: A Brief Survey
Discussiones Mathematicae Graph Theory, 2022 In this paper we present a brief survey of bounds on selected domination parameters. We focus primarily on bounds on domination parameters in terms of the order and minimum degree of the graph. We present a list of open problems and conjectures that have
Henning Michael A.
doaj +1 more source
Bounds on the Double Italian Domination Number of a Graph
Discussiones Mathematicae Graph Theory, 2022 For a graph G, a Roman {3}-dominating function is a function f : V → {0, 1, 2, 3} having the property that for every vertex u ∈ V, if f(u) ∈ {0, 1}, then f(N[u]) ≥ 3.
Azvin Farzaneh, Rad Nader Jafari
doaj +1 more source
Hereditary Equality of Domination and Exponential Domination
Discussiones Mathematicae Graph Theory, 2018 We characterize a large subclass of the class of those graphs G for which the exponential domination number of H equals the domination number of H for every induced subgraph H of G.
Henning Michael A. +2 more
doaj +1 more source
(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs
Discussiones Mathematicae Graph Theory, 2022 The domination gap of a graph G is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs referring to the graphs with domination gap zero, was first introduced by Finbow et
Alizadeh Hadi +2 more
doaj +1 more source
On Generalized Sierpiński Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Rodríguez-Velázquez Juan Alberto +2 more
doaj +1 more source