domination subdivision number
Recently Published Documents


TOTAL DOCUMENTS

35
(FIVE YEARS 7)

H-INDEX

5
(FIVE YEARS 1)

Author(s):  
S. Kosari ◽  
Z. Shao ◽  
R. Khoeilar ◽  
H. Karami ◽  
S. M. Sheikholeslami ◽  
...  


Author(s):  
J. Amjadi ◽  
H. Sadeghi

For a graph [Formula: see text], a double Roman dominating function is a function [Formula: see text] having the property that if [Formula: see text], then vertex [Formula: see text] must have at least two neighbors assigned [Formula: see text] under [Formula: see text] or one neighbor with [Formula: see text], and if [Formula: see text], then vertex [Formula: see text] must have at least one neighbor with [Formula: see text]. The weight of a double Roman dominating function [Formula: see text] is the value [Formula: see text]. The double Roman domination number of a graph [Formula: see text], denoted by [Formula: see text], equals the minimum weight of a double Roman dominating function on [Formula: see text]. The double Roman domination subdivision number [Formula: see text] of a graph [Formula: see text] is the minimum number of edges that must be subdivided (each edge in [Formula: see text] can be subdivided at most once) in order to increase the double Roman domination number. In this paper, we first show that the decision problem associated with sd[Formula: see text] is NP-hard and then establish upper bounds on the double Roman domination subdivision number for arbitrary graphs.



Author(s):  
Saeed Kosari ◽  
Zehui Shao ◽  
Seyed Mahmoud Sheikholeslami ◽  
Hossein Karami ◽  
Lutz Volkmann


Mathematics ◽  
2021 ◽  
Vol 9 (10) ◽  
pp. 1135
Author(s):  
Shouliu Wei ◽  
Guoliang Hao ◽  
Seyed Mahmoud Sheikholeslami ◽  
Rana Khoeilar ◽  
Hossein Karami

A paired-dominating set of a graph G without isolated vertices is a dominating set of vertices whose induced subgraph has perfect matching. The minimum cardinality of a paired-dominating set of G is called the paired-domination number γpr(G) of G. The paired-domination subdivision number sdγpr(G) of G is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the paired-domination number. Here, we show that, for each tree T≠P5 of order n≥3 and each edge e∉E(T), sdγpr(T)+sdγpr(T+e)≤n+2.



Author(s):  
Ammar Babikir ◽  
Magda Dettlaff ◽  
Michael A. Henning ◽  
Magdalena Lemańska

AbstractA set S of vertices in a graph G is a dominating set if every vertex not in S is ad jacent to a vertex in S. If, in addition, S is an independent set, then S is an independent dominating set. The independent domination number i(G) of G is the minimum cardinality of an independent dominating set in G. The independent domination subdivision number $$ \hbox {sd}_{\mathrm{i}}(G)$$ sd i ( G ) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the independent domination number. We show that for every connected graph G on at least three vertices, the parameter $$ \hbox {sd}_{\mathrm{i}}(G)$$ sd i ( G ) is well defined and differs significantly from the well-studied domination subdivision number $$\mathrm{sd_\gamma }(G)$$ sd γ ( G ) . For example, if G is a block graph, then $$\mathrm{sd_\gamma }(G) \le 3$$ sd γ ( G ) ≤ 3 , while $$ \hbox {sd}_{\mathrm{i}}(G)$$ sd i ( G ) can be arbitrary large. Further we show that there exist connected graph G with arbitrarily large maximum degree $$\Delta (G)$$ Δ ( G ) such that $$ \hbox {sd}_{\mathrm{i}}(G) \ge 3 \Delta (G) - 2$$ sd i ( G ) ≥ 3 Δ ( G ) - 2 , in contrast to the known result that $$\mathrm{sd_\gamma }(G) \le 2 \Delta (G) - 1$$ sd γ ( G ) ≤ 2 Δ ( G ) - 1 always holds. Among other results, we present a simple characterization of trees T with $$ \hbox {sd}_{\mathrm{i}}(T) = 1$$ sd i ( T ) = 1 .



Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 439
Author(s):  
Guoliang Hao ◽  
Seyed Mahmoud Sheikholeslami ◽  
Mustapha Chellali ◽  
Rana Khoeilar ◽  
Hossein Karami

In order to increase the paired-domination number of a graph G, the minimum number of edges that must be subdivided (where each edge in G can be subdivided no more than once) is called the paired-domination subdivision number sdγpr(G) of G. It is well known that sdγpr(G+e) can be smaller or larger than sdγpr(G) for some edge e∉E(G). In this note, we show that, if G is an isolated-free graph different from mK2, then, for every edge e∉E(G), sdγpr(G+e)≤sdγpr(G)+2Δ(G).



Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 181 ◽  
Author(s):  
Xiaoli Qiang ◽  
Saeed Kosari ◽  
Zehui Shao ◽  
Seyed Mahmoud Sheikholeslami ◽  
Mustapha Chellali ◽  
...  

For a graph G with no isolated vertex, let γpr(G) and sdγpr(G) denote the paired-domination and paired-domination subdivision numbers, respectively. In this note, we show that if T is a tree of order n≥4 different from a healthy spider (subdivided star), then sdγpr(T)≤min{γpr(T)2+1,n2}, improving the (n−1)-upper bound that was recently proven.



2020 ◽  
Vol 40 (2) ◽  
pp. 501-511
Author(s):  
J. Amjadi ◽  
R. Khoeilar ◽  
M. Chellali ◽  
Z. Shao


2020 ◽  
Vol 174 (1) ◽  
pp. 15-26 ◽  
Author(s):  
Canan Çiftçi ◽  
Vecdi Aytaç


2019 ◽  
Vol 11 (03) ◽  
pp. 1950036
Author(s):  
S. V. Divya Rashmi ◽  
A. Somasundaram ◽  
S. Arumugam

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 dominating set of [Formula: see text] In this case, we say that [Formula: see text] is [Formula: see text]-defended by [Formula: see text] or [Formula: see text] [Formula: see text]-defends [Formula: see text] The secure domination number [Formula: see text] is the minimum cardinality of a secure dominating set of [Formula: see text] The secure domination subdivision number of [Formula: see text] is the minimum number of edges that must be subdivided (each edge in [Formula: see text] can be subdivided at most once) in order to increase the secure domination number. In this paper, we present several results on this parameter.



Sign in / Sign up

Export Citation Format

Share Document