Results 51 to 60 of about 1,519 (103)
GLOBAL RAINBOW DOMINATION IN GRAPHS
, 2017 For a positive integer k, a k-rainbow dominating function (kRDF) of a graph G is a function f from the vertex set V.G/ to the set of all subsets of the set f1;2; : : : ;kg such that for any vertex v 2 V.G/ with f .v/ D ¿, the condition S u2N.v/f .u/ D f1;
J. Amjadi +2 more
semanticscholar +1 more source
On Domination Number and Distance in Graphs [PDF]
, 2014 A vertex set $S$ of a graph $G$ is a \emph{dominating set} if each vertex of $G$ either belongs to $S$ or is adjacent to a vertex in $S$. The \emph{domination number} $\gamma(G)$ of $G$ is the minimum cardinality of $S$ as $S$ varies over all dominating ...
Kang, Cong X.
core
Connected Edge Litact Domination in Graphs
International Journal of Innovative Technology and Exploring Engineering, 2019 A subset of edges dominating in is connected edge dominating, if , the subgraph induced by is connected.The connected edge litact domination number , is .In This article we could able to bring up some interesting results on connected edge litact ...
semanticscholar +1 more source
Blast-Transition Domination for the -∂ Obrazom of Zero Divisor Graph over Ring Zn
International Journal of Engineering and Advanced Technology, 2019 The hub of this article is a search on the behavior of the blast domination and the blast transition domination for the obrazom of zero divisor graphs.AMS Subject Classification: 13A99, 13M99, 05C76, 05C69.
semanticscholar +1 more source
A Constructive Characterization of Vertex Cover Roman Trees
Discussiones Mathematicae Graph Theory, 2021 A Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for which f (v) = 2.
Martínez Abel Cabrera +2 more
doaj +1 more source
Changing and Unchanging of the Domination Number of a Graph: Path Addition Numbers
Discussiones Mathematicae Graph Theory, 2021 Given a graph G =(V, E) and two its distinct vertices u and v, the (u, v)-Pk-addition graph of G is the graph Gu,v,k−2 obtained from disjoint union of G and a path Pk : x0, x1,...,xk−1, k ≥ 2, by identifying the vertices u and x0, and identifying the ...
Samodivkin Vladimir
doaj +1 more source
Independent Transversal Total Domination Versus Total Domination in Trees
Discussiones Mathematicae Graph Theory, 2021 A subset of vertices in a graph G is a total dominating set if every vertex in G is adjacent to at least one vertex in this subset. The total domination number of G is the minimum cardinality of any total dominating set in G and is denoted by γt(G).
Martínez Abel Cabrera +2 more
doaj +1 more source
Sufficient Conditions for a Digraph to Admit A (1, ≤ ℓ)-Identifying Code
Discussiones Mathematicae Graph Theory, 2021 A (1, ≤ ℓ)-identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most ℓ have distinct closed in-neighbourhoods within C. In this paper, we give some sufficient conditions for a digraph
Balbuena Camino +2 more
doaj +1 more source
On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs [PDF]
AMS classifications: 05C69; 90C35; 90C22;Erdos-Renyi graph;stability number;Lovasz O-number;Schrijver O-number;C*-algebra;semidefinite ...
Klerk, E. de +3 more
core +1 more source
On the number of outer connected dominating sets of graphs
, 2012 Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $V\backslash S$ is a connected graph.
Akhbari, Mohammad H. +2 more
core