Results 11 to 20 of about 1,516 (111)
Journal of Education College Wasit University, 2021 Let {\ \ \gamma}^e(G) be the edge domination number of a graph. A “web graph” W(s,t) is obtained from the Cartesian product of cycle graph of order s\ and path graph of order\ t.
A. Omran, M. Al-Harere
semanticscholar +1 more source
On a Vizing-type integer domination conjecture [PDF]
, 2020 Given a simple graph $G$, a dominating set in $G$ is a set of vertices $S$ such that every vertex not in $S$ has a neighbor in $S$. Denote the domination number, which is the size of any minimum dominating set of $G$, by $\gamma(G)$.
Davila, Randy, Krop, Elliot
core +3 more sources
Total Dominator Colorings in Cycles [PDF]
, 2012 Determining the total dominator chromatic number in ...
Vijayalekshmi, A.
core +2 more sources
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
On solution-free sets of integers II [PDF]
, 2016 Given a linear equation L, a set A ⊆ [n] is L-free if A does not contain any ‘non-trivial’ solutions to L. We determine the precise size of the largest L-free subset of [n] for several general classes of linear equations L of the form px+ qy = rz for ...
Robert Hancock, Andrew Treglown
semanticscholar +1 more source
On defensive alliances and line graphs [PDF]
, 2006 Let $\Gamma$ be a simple graph of size $m$ and degree sequence $\delta_1\ge \delta_2\ge ... \ge \delta_n$. Let ${\cal L}(\Gamma)$ denotes the line graph of $\Gamma$. The aim of this paper is to study mathematical properties of the alliance number, ${a}({\
Rodriguez, J. A., Sigarreta, J. M.
core +3 more sources
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
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
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