Results 21 to 30 of about 9,666,055 (254)
Some inequalities about connected domination number [PDF]
, 1996 Let G = (V,E) be a graph. In this note, γc, ir, γ, i, β0, Γ, IR denote the connected domination number, the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper ...
Liu, Bolian, Bo, Cheng
core +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Let G = (V;E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V - S, there exists u ∈ S such that d(u; v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G ...
Natarajan C., Ayyaswamy S.K.
doaj +1 more source
Connected Domination Number and a New Invariant in Graphs with Independence Number Three [PDF]
Computer Science Journal of Moldova, 2021 Adding a connected dominating set of vertices to a graph $G$ increases its number of Hadwiger $h(G)$. Based on this obvious property in [2] we introduced a new invariant $\eta(G)$ for which $\eta(G)\leq h(G)$. We continue to study its property.
Vladimir Bercov
doaj
On domination multisubdivision number of unicyclic graphs [PDF]
Opuscula Mathematica, 2018 The paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram,
Joanna Raczek
doaj +1 more source
Steiner domination decomposition number of graphs
Ratio Mathematica, 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 ...
M Mahiba, E Ebin Raja Merly
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 +2 more
core +1 more source
Connected domination value in graphs
Electronic Journal of Graph Theory and Applications, 2021 In a connected graph G = (V,E), a set D ⊂ V is a connected dominating set if for every vertex v ∈ V \ D, there exists u ∈ D such that u and v are adjacent, and the subgraph〈D〉induced by D in G is connected.
Angsuman Das
doaj +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
[1,2] -Connected domination number of graphs
, 2021 A set in a graph G is said to be a -connected dominating set if for every vertex , and is connected. The minimum cardinality of a -connected dominating set is called the -connected domination number and is denoted by .
et. al., G. Mahadevan,
core +1 more source
Extremal connected graphs for independent domination number [PDF]
, 2004 A general characterization of connected graphs on n vertices having the maximum possible independent domination number of ⌊n+2−2n⌋ is given. This result leads to a structural characterization of such graphs in all but a small finite number of cases.
Carrington, Julie R. +2 more
core +2 more sources