Results 201 to 210 of about 612 (219)
Some of the next articles are maybe not open access.
TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS
Discrete Mathematics, Algorithms and Applications, 2013A set S of vertices of a graph G is a total outer-connected dominating set if every vertex in V(G) is adjacent to some vertex in S and the subgraph G[V\S] induced by V\S is connected. The total outer-connected domination numberγ toc (G) is the minimum size of such a set.
Odile Favaron +2 more
openaire +2 more sources
An Upper Bound for the Total Domination Subdivision Number of a Graph
Graphs and Combinatorics, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Karami 0002 +3 more
openaire +1 more source
Semitotal domination subdivision numbers of graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2019A set D of vertices in an isolate-free graph G is a semitotal dominating set of G if D is a dominating set of G and every vertex in D is within distance 2 of another vertex of D.
Qin Chen, Yunfang Tang
openaire +1 more source
Domination subdivision numbers in graphs
2004A set \(S\) of vertices of a graph \(G\) is a dominating set if each vertex outside \(S\) has a neighbor in \(S\). The domination number \(\gamma(G)\) of \(G\) is the minimum cardinality of a dominating set of \(G\). An edge \(uv\) in \(G\) is subdivided if the edge \(uv\) is deleted, but a new vertex \(x\) is added, along with two new edges \(xu\) and
Favaron, Odile +2 more
openaire +2 more sources
On the rainbow domination subdivision numbers in graphs
Asian-European Journal of Mathematics, 2016A [Formula: see text]-rainbow dominating function (2RDF) of a graph [Formula: see text] is a function [Formula: see text] from the vertex set [Formula: see text] to the set of all subsets of the set [Formula: see text] such that for any vertex [Formula: see text] with [Formula: see text] the condition [Formula: see text] is fulfilled, where [Formula ...
Dehgardi, N. +3 more
openaire +2 more sources
Upper Bounds on the Paired Domination Subdivision Number of a Graph
Graphs and Combinatorics, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshimi Egawa +2 more
openaire +2 more sources
Domination Uniform Subdivision Number of Graph
International Journal of Mathematics Trends and Technology, 2015Let G = (V, E) be a simple undirected graph. A subset D of V (G) is said to be dominating set if every vertex of V (G) − D is adjacent to at least one vertex in D. The minimum cardinality taken over all minimal dominating sets of G is the domination number of G and is denoted by γ(G). The domination uniform subdivision number of G is the least positive
openaire +1 more source
Semitotal domination subdivision numbers of graphs
Journal of Discrete Mathematical Sciences and Cryptography, 2020Qin Chen, Yunfang Tang
exaly
On the domination subdivision numbers of trees. [PDF]
Australas. J Comb., 2010 B. Sharada, Nandappa D. Soner
openaire
Total domination and total domination subdivision numbers. [PDF]
Australas. J Comb., 2007 Odile Favaron +2 more
openaire