A linear-time algorithm for weighted paired-domination on block graphs

Author(s):  
Ching-Chi Lin ◽  
Cheng-Yu Hsieh ◽  
Ta-Yu Mu
2016 ◽  
Vol 630 ◽  
pp. 43-62 ◽  
Author(s):  
Stefan Hoffmann ◽  
Alina Elterman ◽  
Egon Wanke

2017 ◽  
Vol 62 ◽  
pp. 249-254 ◽  
Author(s):  
Gabriela R. Argiroffo ◽  
Silvia M. Bianchi ◽  
Yanina Lucarini ◽  
Annegret K. Wagler

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 293
Author(s):  
Xinyue Liu ◽  
Huiqin Jiang ◽  
Pu Wu ◽  
Zehui Shao

For a simple graph G=(V,E) with no isolated vertices, a total Roman {3}-dominating function(TR3DF) on G is a function f:V(G)→{0,1,2,3} having the property that (i) ∑w∈N(v)f(w)≥3 if f(v)=0; (ii) ∑w∈N(v)f(w)≥2 if f(v)=1; and (iii) every vertex v with f(v)≠0 has a neighbor u with f(u)≠0 for every vertex v∈V(G). The weight of a TR3DF f is the sum f(V)=∑v∈V(G)f(v) and the minimum weight of a total Roman {3}-dominating function on G is called the total Roman {3}-domination number denoted by γt{R3}(G). In this paper, we show that the total Roman {3}-domination problem is NP-complete for planar graphs and chordal bipartite graphs. Finally, we present a linear-time algorithm to compute the value of γt{R3} for trees.


Sign in / Sign up

Export Citation Format

Share Document