Results 31 to 40 of about 8,782,249 (234)

Changing of the domination number of a graph: edge multisubdivision and edge removal [PDF]

Mathematica Bohemica, 2017
For a graphical property $\mathcal{P}$ and a graph $G$, a subset $S$ of vertices of $G$ is a $\mathcal{P}$-set if the subgraph induced by $S$ has the property $\mathcal{P}$.
Vladimir Samodivkin
doaj   +1 more source

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, Walikar, H.B., Kishori P.Narayankar   +2 more
core   +1 more source

Total dominator chromatic number of k-subdivision of graphs

The Art of Discrete and Applied Mathematics, 2022
Let $G$ be a simple graph. A total dominator coloring of $G$, is a proper coloring of the vertices of $G$ in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic (TDC) number $χ_d^t(G)$ of $G$, is the minimum number of colors among all total dominator coloring of $G$.
Alikhani, Saeid, Ghanbari, Nima, Soltani, Samaneh   +2 more
openaire   +4 more sources

Bounds on Total Domination Subdivision Numbers. [PDF]

, 2003
The domination subdivision number of a graph is the minimum number of edges that must be subdivided in order to increase the domination number of the graph.
Hopkins, Lora Shuler
core   +1 more source

An interpolatory subdivision algorithm for surfaces over arbitrary triangulations [PDF]

, 1992
In this paper, an interpolatory subdivision algorithm for surfaces over ar-bitrary triangulations is introduced and its convergence properties over nonuni-form triangulations studied.
Qu, R
core   +6 more sources

Rainbow game domination subdivision number of a graph [PDF]

Romanian Journal of Mathematics and Computer Science, 2014
The rainbow game domination subdivision number of a graph G is defined by the following game. Two players D and A, D playing first, alternately mark or subdivide an edge of G which is not yet marked nor subdivided.
J. Amjadi
doaj  

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, V. Zverovich, Poghosyan, Anush, A. Poghosyan   +3 more
core   +1 more source

The Number of Minimum Dominating Sets in Pn × P2 [PDF]

, 2010
A set S of vertices in a graph G is said to be a Smarandachely k-dominating set if each vertex of G is dominated by at least k vertices of S.
Kishori P. Narayankar, Shirakol, Shailaja S., Shailaja S. Shirakol, H.B.Walikar, Narayankar, Kishori P., H. B. Walikar   +5 more
core   +1 more source

Total Domination Multisubdivision Number of a Graph

Discussiones Mathematicae Graph Theory, 2015
The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G.
Avella-Alaminos Diana, Dettlaff Magda, Lemańska Magdalena, Zuazua Rita   +3 more
doaj   +1 more source

Secure monophonic domination of graphs [PDF]

Journal of Hyperstructures
Let G = (V, E) be a connected graph. A monophonic dominating set M is said to be a secure monophonic dominating set Sm (abbreviated as SMD set) of G if for each v∈V \M there exists u∈M such that v is adjacent to u and Sm = {M \(u)} ∪{v} is a monophonic ...
K Sunitha, D Divya
doaj   +1 more source