Results 11 to 20 of about 15,114,292 (210)
Singed Total Domatic Number of a Graph [PDF]
, 2010 The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 more
core +1 more source
On Roman, Global and Restrained Domination in Graphs [PDF]
, 2010 In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible.
Zverovich, Vadim +3 more
core +1 more source
Triple Connected Domination Number of a Graph [PDF]
, 2012 The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source
On signed majority total domination in graphs [PDF]
, 2005 summary:We initiate the study of signed majority total domination in graphs. Let $G=(V,E)$ be a simple graph. For any real valued function $f\: V \rightarrow \mathbb{R}$ and ${S\subseteq V}$, let $f(S)=\sum _{v\in S}f(v)$.
Sun, Liang +2 more
core +1 more source
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
Signed total domination number of a graph [PDF]
, 2001 summary:The signed total domination number of a graph is a certain variant of the domination number. If $v$ is a vertex of a graph $G$, then $N(v)$ is its oper neighbourhood, i.e. the set of all vertices adjacent to $v$ in $G$.
Zelinka, Bohdan
core +3 more sources
Theoretical results for Perfect Location signed Roman domination problem [PDF]
The study of Roman domination has evolved to encompass a variety of challenging extensions, each contributing to the broader understanding of domination problems in graph theory.
Nikolić, Bojan +2 more
core +9 more sources
On the Roman Edge Domination Number of a Graph [PDF]
, 2010 Let G be a simple graph with vertex set V (G) and edge set E(G)
K. Ebadi +5 more
core +1 more source
New Bounds on the Signed Total Domination Number of Graphs [PDF]
, 2016 In this paper, we study the signed total domination number in graphs and present new sharp lower and upper bounds for this parameter. For example by making use of the classic theorem of Turán [8], we present a sharp lower bound on Kr+1-free graphs for r ≥
Mojdeh Doost Ali +3 more
core +2 more sources
Signed 2-domination in caterpillars [PDF]
, 2003 summary:A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number $\gamma ^2_{\mathrm s}(G)$ and the signed total 2-domination number $\gamma ^2_{\mathrm {st}}(G)$
Zelinka, Bohdan, Bohdan Zelinka
core +1 more source