Results 11 to 20 of about 14,286,036 (225)

On total domination subdivision numbers of trees [PDF]

Discussiones Mathematicae Graph Theory
15 pages, 7 ...
Michael A. Henning, Jerzy Topp
core   +5 more sources

Matchings and total domination subdivision number in graphs with few induced 4-cycles [PDF]

Discussiones Mathematicae Graph Theory, 2010
A set S of vertices of a graph G = (V; E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. The total domination number t(G) is the minimum cardinality of a total dominating set of G.
Odile Favaron, Hossein Karami 0002, Rana Khoeilar, Seyed Mahmoud Sheikholeslami   +3 more
openaire   +2 more sources

On upper bounds for total $k$-domination number via the probabilistic method [PDF]

, 2023
summary:For a fixed positive integer $k$ and $G=(V, E)$ a connected graph of order $n$, whose minimum vertex degree is at least $k$, a set $S\subseteq V$ is a total $k$-dominating set, also known as a $k$-tuple total dominating set, if every vertex $v\in
Cruz-Suárez, Hugo, Sigarreta, Saylé, Sigarreta, Saylí   +2 more
core   +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

Perfect Domination Excellent Trees [PDF]

, 2012
A set D of vertices of a graph G is a perfect dominating set if every vertex in V \ D is adjacent to exactly one vertex in D. In this paper we introduce the concept of perfect domination excellent graph as a graph in which every vertex belongs to some ...
Sharada, B., Sharada B.
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, T.Subramanian, Joseph, Paulraj, J.Paulraj Joseph, G.Mahadevan, Avadayappan, Selvam, Subramanian, T., Mahadevan, G.   +7 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, H.Abdollahzadeh Ahangar, Abdollahzadeh Ahangar, H., Pushpalatha L.   +3 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, V. Zverovich, Poghosyan, Anush, A. Poghosyan   +3 more
core   +1 more source

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

Domination parameters of a graph with added vertex [PDF]

Opuscula Mathematica, 2004
Let \(G=(V,E)\) be a graph. A subset \(D\subseteq V\) is a total dominating set of \(G\) if for every vertex \(y\in V\) there is a vertex \(x\in D\) with \(xy\in E\).
Maciej Zwierzchowski
doaj