Results 31 to 40 of about 490,847 (283)
Minimum Neighborhood Domination of Split Graph of Graphs
مجلة بغداد للعلوم, 2023 Let be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set.
ANJALINE. W, A.STANIS ARUL MARY
doaj +1 more source
Kernelization and Sparseness: the case of Dominating Set [PDF]
, 2015 We prove that for every positive integer $r$ and for every graph class $\mathcal G$ of bounded expansion, the $r$-Dominating Set problem admits a linear kernel on graphs from $\mathcal G$.
Drange, Pål Grønås +11 more
core +2 more sources
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
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.
Ron Aharoni, Irina Gorelik
openaire +3 more sources
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +1 more source
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
On the dominating set polytope
European Journal of Combinatorics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bouchakour, Mustapha +3 more
openaire +3 more sources
DOMINATING SET ON CHAIN OF FUZZY GRAPHS
Tikrit Journal of Pure Science, 2023 In this paper, we define fuzzy graph chains, which comprise vertex identification. These fuzzy graphs are isomorphic fuzzy graphs, provide that after applying various features to the chain of fuzzy graphs, which as special fuzzy graph chain of .
Russel H. Majeed, Nabeel E. Arif
doaj +1 more source
Journal of Graph Theory, 1994 AbstractLet G = (V, E) be a connected graph. A set D ⊂ V is a set‐dominating set (sd‐set) if for every set T ⊂ V − D, there exists a nonempty set S ⊂ D such that the subgraph 〈S ∪ T〉 induced by S ∪ T is connected. The set‐domination number γs(G) of G is the minimum cardinality of a sd‐set.
E. Sampathkumar 0001, L. Pushpalatha
openaire +2 more sources
The $k$-Dominating Graph [PDF]
, 2013 Given a graph $G$, the $k$-dominating graph of $G$, $D_k(G)$, is defined to be the graph whose vertices correspond to the dominating sets of $G$ that have cardinality at most $k$.
Haas, Ruth, Seyffarth, Karen
core +3 more sources