Results 11 to 20 of about 9,080,049 (206)

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

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

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

Upper bounds on the paired-domination number [PDF]

, 2008
A set S of vertices in a graph G is a paired-dominating set of G if every vertex of G is adjacent to some vertex in S and the subgraph induced by S contains a perfect matching.
Chen, Xue-gang, Chan, Wai Hong, Shiu, Wai Chee   +2 more
core   +1 more source

Disjunctive Total Domination Subdivision Number of Graphs

, 2020
A set S subset of V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it.
Aytac, Vecdi, Ciftci, Canan
core   +1 more source

Domination subdivision and domination multisubdivision numbers of graph [PDF]

, 2019
The domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T) ≤ 3 for any tree
Topp, Jerzy, Joanna Raczek, Jerzy Topp, Raczek, Joanna, Dettlaff, Magda, Magda Dettlaff   +5 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

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

Trees whose 2-domination subdivision number is 2 [PDF]

, 2012
A set \(S\) of vertices in a graph \(G = (V,E)\) is a \(2\)-dominating set if every vertex of \(V\setminus S\) is adjacent to at least two vertices of \(S\). The \(2\)-domination number of a graph \(G\), denoted by \(\gamma_2(G)\), is the minimum size of
M. Atapour, Khodkar, A., Abdollah Khodkar, M Atapour, S. M. Sheikholeslami, Sheikholeslami, S. M., S M Sheikholeslami, Atapour, M.   +7 more
core   +3 more sources

Paired Domination in Graphs

, 2020
A set S of vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching (not necessarily as an induced subgraph).
Haynes, Teresa W., Michael A. Henning, Desormeaux, Wyatt J., Teresa W. Haynes, Wyatt J. Desormeaux, Henning, Michael A.   +5 more
core   +1 more source