Results 21 to 30 of about 9,933,640 (289)
Tadpole Domination in Graphs [PDF]
مجلة بغداد للعلوم, 2018 A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite,
Baghdad Science Journal
doaj +2 more sources
Connected domination number and traceable graphs [PDF]
Electronic Journal of Mathematics, 2023 Phillip Mafuta
doaj +2 more sources
The Connected Domination Number of Grids [PDF]
, 2021 Closed form expressions for the domination number of an $n \times m$ grid have attracted significant attention, and an exact expression has been obtained in 2011 by Gonçalves et al. In this paper, we present our results on obtaining new lower bounds on the connected domination number of an $n \times m$ grid.
Adarsh Srinivasan, N. S. Narayanaswamy
openaire +2 more sources
Rainbow Connection Number and Connected Dominating Sets [PDF]
Electronic Notes in Discrete Mathematics, 2011 AbstractThe rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree δ, the rainbow connection number ...
L. Sunil Chandran +3 more
openaire +6 more sources
On the doubly connected domination number of a graph [PDF]
Open Mathematics, 2006 Abstract For a given connected graph G = (V, E), a set $$D \subseteq V(G)$$ is a doubly connected dominating set if it is dominating and both 〈D〉 and 〈V (G)-D〉 are connected. The cardinality of the minimum doubly connected dominating set in G is the doubly connected domination number.
Cyman Joanna +2 more
doaj +2 more sources
Connected Domination Number of a Graph and its Complement [PDF]
Graphs and Combinatorics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Karami 0002 +3 more
openaire +2 more sources
Total connected domination game [PDF]
Opuscula Mathematica, 2021 The (total) connected domination game on a graph \(G\) is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirement that at each stage of the game the selected vertices induce a ...
Csilla Bujtás +3 more
doaj +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 +3 more
core +1 more source
On graphs with equal domination and connected domination numbers
Discrete Mathematics, 1999 A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called dominating in \(G\), if each vertex of \(G\) either is in \(S\), or is adjacent to a vertex of \(S\). The minimum number of vertices of a dominating set in \(G\) is the dominating number \(\gamma(G)\) of \(G\).
S. Arumugam 0001, J. Paulraj Joseph
openaire +2 more sources
[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