Results 11 to 20 of about 9,933,640 (289)
Weakly connected domination subdivision numbers [PDF]
Discussiones Mathematicae Graph Theory, 2008 A set D of vertices in a graph G = (V, E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected. The weakly connected domination number of G is the minimum cardinality of a weakly connected dominating set of G.
Raczek, Joanna
openaire +2 more sources
Average distance and connected domination
AKCE International Journal of Graphs and Combinatorics, 2023 We give a tight upper bound on the average distance of a connected graph of given order in terms of its connected domination number. Our results are a strengthening of a result by DeLaViña, Pepper, and Waller [A note on dominating sets and average ...
P. Mafuta, S. Mukwembi
doaj +2 more sources
Connected cototal domination number of a graph [PDF]
Transactions on Combinatorics, 2012 A dominating set $D subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $langle D rangle$ is connected and $langle V-D rangle neq phi$, contains no isolated vertices.
B Basavanagoud, Sunilkumar M Hosamani
doaj +1 more source
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 +3 more sources
Extremal connected graphs for independent domination number
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brigham, Robert C. +2 more
core +5 more sources
On the number of edges in graphs with a given connected domination number
Discrete Mathematics, 2000 The paper is devoted to the problem of finding the maximum number of edges in a graph with given connected domination number. A connected dominating set \(V\) of a graph \(G\) is a set of vertices that is dominating and the graph induced by \(V\) is connected. The connected domination number of \(G\) is the size of its smallest connected dominating set.
Sanchis, Laura A.
openaire +3 more sources
Triple Connected Domination Number Of A Graph [PDF]
, 2012 The concept of triple connected graphs with real life application was introduced in [7] by considering the existence of a path containing any three vertices of a graph G. In this paper, we introduce a new domination parameter, called Smarandachely triple connected domination number of a graph.
Mahadevan, G. +3 more
openaire +4 more sources
Total Domination Multisubdivision Number of a Graph [PDF]
Discussiones Mathematicae Graph Theory, 2015 The domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G.
Avella-Alaminos Diana +3 more
doaj +3 more sources
Steiner domination decomposition number of graphs [PDF]
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 +2 more sources
When the connected domination number is at most the total domination number [PDF]
, 2011 In this note we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number. This question is motivated by the fact that any connected dominating set of size at least 2 is in particular a total ...
Schaudt, Oliver
openaire +2 more sources