Results 211 to 220 of about 8,782,249 (234)

Upper Bounds on the Paired Domination Subdivision Number of a Graph

Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michitaka Furuya, Yoshimi Egawa
exaly   +3 more sources

On the total domination subdivision number in some classes of graphs

Journal of Combinatorial Optimization, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rana Khoeilar, Seyed Mahmoud Sheikholeslami, H Karami   +2 more
exaly   +3 more sources

On the Roman domination subdivision number of a graph

Journal of Combinatorial Optimization, 2020
Let \(G\) be a graph and let \(V_0\), \(V_1\), \(V_2\) be a partition of \(V(G)\). Such a partition is a Roman partition if every vertex from \(V_0\) has a neighbor in \(V_2\). The Roman domination number is \(\gamma_R(G)=\min\{2|V_2|+|V_1|\}\), where the minimum is taken over all Roman partitions of \(G\).
Jafar Amjadi, R. Khoeilar, Mustapha Chellali, Zehui Shao   +3 more
openaire   +1 more source

Secure domination subdivision number of a graph

Discrete Mathematics, Algorithms and Applications, 2019
Let [Formula: see text] be a graph of order [Formula: see text] and size [Formula: see text] A dominating set [Formula: see text] of [Formula: see text] is called a secure dominating set if for each [Formula: see text] there exists [Formula: see text] such that [Formula: see text] is adjacent to [Formula: see text] and [Formula: see text] is a ...
S. V. Divya Rashmi, A. Somasundaram, S. Arumugam 0001   +2 more
openaire   +1 more source

Game domination subdivision number of a graph

Journal of Combinatorial Optimization, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Odile Favaron, Hossein Karami 0002, Seyed Mahmoud Sheikholeslami   +2 more
openaire   +1 more source

Game total domination subdivision number of a graph

Discrete Mathematics, Algorithms and Applications, 2015
A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination numberγt(G) is the minimum cardinality of a total dominating set of G. The game total domination subdivision number of a graph G is defined by the following game. Two players 𝒟 and 𝒜,
Jafar Amjadi, Hossein Karami 0002, Seyed Mahmoud Sheikholeslami   +2 more
openaire   +2 more sources

Some Graphs with Double Domination Subdivision Number Three

Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haoli Wang, Xirong Xu, Yuansheng Yang, Baosheng Zhang   +3 more
openaire   +1 more source

TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS

Discrete Mathematics, Algorithms and Applications, 2013
A 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, Rana Khoeilar, Seyed Mahmoud Sheikholeslami   +2 more
openaire   +3 more sources

An Upper Bound for the Total Domination Subdivision Number of a Graph

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hossein Karami 0002, R. Khoeilar, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar   +3 more
openaire   +1 more source

Semitotal domination subdivision numbers of graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2019
A 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