Results 11 to 20 of about 1,497 (106)
Offensive alliances in cubic graphs [PDF]
, 2006 An offensive alliance in a graph $\Gamma=(V,E)$ is a set of vertices $S\subset V$ where for every vertex $v$ in its boundary it holds that the majority of vertices in $v$'s closed neighborhood are in $S$.
Rodriguez, J. A., Sigarreta, J. M.
core +3 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
Relating the super domination and 2-domination numbers in cactus graphs
Open Mathematics, 2023 A set D⊆V(G)D\subseteq V\left(G) is a super dominating set of a graph GG if for every vertex u∈V(G)\Du\in V\left(G)\setminus D, there exists a vertex v∈Dv\in D such that N(v)\D={u}N\left(v)\setminus D=\left\{u\right\}.
Cabrera-Martínez Abel +1 more
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
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
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
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
A Note on the Locating-Total Domination in Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain a sharp (improved) lower bound on the locating-total domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
Miller Mirka +4 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