Results 11 to 20 of about 8,468 (237)
On Independent Domination in Planar Cubic Graphs
Discussiones Mathematicae Graph Theory, 2019 A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S.
Abrishami Gholamreza +2 more
doaj +3 more sources
Independent domination versus weighted independent domination [PDF]
Information Processing Letters, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lozin V. +3 more
openaire +5 more sources
Independent Domination Subdivision in Graphs [PDF]
Graphs and Combinatorics, 2021 AbstractA set S of vertices in a graph G is a dominating set if every vertex not in S is ad jacent to a vertex in S. If, in addition, S is an independent set, then S is an independent dominating set. The independent domination number i(G) of G is the minimum cardinality of an independent dominating set in G.
Babikir, Ammar +3 more
openaire +1 more source
Independent domination in subcubic graphs [PDF]
Journal of Combinatorial Optimization, 2021 Submitted to Discrete Applied Mathematics Journal, 08 Jan ...
Akbari, A. +5 more
openaire +3 more sources
Stochastic Dominance under Independent Noise [PDF]
Journal of Political Economy, 2020 24 pages. Minor changes.
Pomatto, Luciano +2 more
openaire +3 more sources
Domination, Independent Domination and $k$-independence in Trees
Taiwanese Journal of Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Gang, Wu, Baoyindureng
openaire +2 more sources
Domination versus independent domination in regular graphs [PDF]
Journal of Graph Theory, 2021 AbstractA set of vertices in a graph is a dominating set if every vertex of is in or is adjacent to a vertex in . If, in addition, is an independent set, then is an independent dominating set. The domination number of is the minimum cardinality of a dominating set in , while the independent domination number of is the minimum cardinality of ...
Martin Knor +2 more
openaire +2 more sources
Further results on independent double roman trees
AKCE International Journal of Graphs and Combinatorics, 2022 A double Roman dominating function (DRDF) on a graph [Formula: see text] is a function [Formula: see text] such that every vertex u with f(u) = 0 is adjacent to at least one vertex assigned a 3 or to at least two vertices assigned a 2, and every vertex v
A. Rahmouni +3 more
doaj +1 more source
Weighted Domination of Independent Sets [PDF]
Graphs and Combinatorics, 2019 The {\em independent domination number} $ ^i(G)$ of a graph $G$ is the maximum, over all independent sets $I$, of the minimal number of vertices needed to dominate $I$. It is known \cite{abz} that in chordal graphs $ ^i$ is equal to $ $, the ordinary domination number.
Aharoni, Ron, Gorelik, Irina
openaire +3 more sources
Independent double Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a graph G = (V,E), a double Roman dominating function has the property that for every vertex with f(v) = 0, either there exists a vertex , with f(u) = 3, or at least two neighbors having f(x) = f(y) = 2, and every vertex with value 1 under f has at ...
H. R. Maimani +3 more
doaj +1 more source