Results 191 to 200 of about 612 (219)

Disproof of a Conjecture on the Subdivision Domination Number of a Graph

Graphs and Combinatorics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
O Favaron, H Karami, S M Sheikholeslami   +2 more
exaly   +3 more sources

A New Bound on the Total Domination Subdivision Number

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
O Favaron, H Karami, R Khoeilar
exaly   +2 more sources

Disprove of a Conjecture on the Doubly Connected Domination Subdivision Number

Bulletin of the Iranian Mathematical Society, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saeed Kosari, Zehui Shao, S M Sheikholeslami   +2 more
exaly   +3 more sources

Roman domination subdivision number of graphs

Aequationes Mathematicae, 2009
A Roman dominating function on a graph G = (V, E) is a function $$f : V \rightarrow \{0, 1, 2\}$$ satisfying the condition that every vertex v for which f(v) = 0 is adjacent to at least one vertex u for which f(u) = 2. The weight of a Roman dominating function is
S M Sheikholeslami, Sheikholeslami S M
exaly   +2 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.
O Favaron, H Karami, R Khoeilar
exaly   +2 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

Disjunctive Total Domination Subdivision Number of Graphs

Fundamenta Informaticae, 2020
A set S ⊆ V (G) is a disjunctive total dominating set of G if every vertex has a neighbor in S or has at least two vertices in S at distance 2 from it. The disjunctive total domination number is the minimum cardinality of a disjunctive total dominating set in G. We define the disjunctive total domination subdivision number of G as the minimum number of
Ciftci, Canan, Aytac, Vecdi
openaire   +2 more sources

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