Results 31 to 40 of about 9,176,317 (295)

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, H.Abdollahzadeh Ahangar, Abdollahzadeh Ahangar, H., Pushpalatha L.   +3 more
core   +1 more source

On the Paired-Domination Subdivision Number of a Graph

Mathematics, 2021
In order to increase the paired-domination number of a graph G, the minimum number of edges that must be subdivided (where each edge in G can be subdivided no more than once) is called the paired-domination subdivision number sdγpr(G) of G.
Guoliang Hao, Seyed Mahmoud Sheikholeslami, Mustapha Chellali, Rana Khoeilar, Hossein Karami   +4 more
doaj   +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, T.Subramanian, Joseph, Paulraj, J.Paulraj Joseph, G.Mahadevan, Avadayappan, Selvam, Subramanian, T., Mahadevan, G.   +7 more
core   +1 more source

A note on the k-domination number of a graph [PDF]

, 1990
summary:Let $G=(V, E)$ be a simple graph. A subset $S\subseteq V$ is a dominating set of $G$, if for any vertex $u\in V-S$, there exists a vertex $v\in S$ such that $uv\in E$.
Liang Sun, Y. Roditty, Zhou, S, Y. Caro, Zhou, Sanming, Volkmann, Lutz, Sun, Liang, Hua-ming Xing, Xue-gang Chen, Chen, Xue-Gang, Xing, Hua-Ming, Liu, Hailong   +11 more
core   +3 more sources

Domination and Power Domination in Certain Families of Nanostars Dendrimers

IEEE Access, 2020
Dendrimers are hyper-branched macromolecules having various applications in diverse fields like supra-molecular chemistry, drug delivery and nanotechnology etc.
Tanveer Iqbal, Muhammad Imran, Syed Ahtsham Ul Haq Bokhary   +2 more
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

On the domination search number

Discrete Applied Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fedor V. Fomin, Dieter Kratsch, Haiko Müller   +2 more
openaire   +2 more sources

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

Steiner domination decomposition number of graphs [PDF]

, 2022
In this paper, we introduce a new concept Steiner domination decomposition number of graphs. Let  be a connected graph with Steiner domination numberA decomposition  of  is said to be a Steiner Domination Decomposition  if  Steiner domination ...
Mahiba, M, Ebin Raja Merly, E
core   +1 more source

Domination Subdivision Numbers

Discussiones Mathematicae Graph Theory, 2001
A set \(S\) of vertices of a graph \(G\) is a dominating set if every vertex of \(V(G)-S\) is adjacent to some vertex in \(S\). The domination number \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\), and the domination subdivision number \(\text{sd}_{\gamma}(G)\) is the minimum number of edges that must be subdivided (each edge in \
Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe   +5 more
openaire   +1 more source