|
|
|
|
a linear-time algorithm to compute total [1, 2]-domination number of block graphs
|
|
|
|
|
|
|
|
نویسنده
|
alikhani saeid ,hooshmandasl mohammadreza ,sharifani pouyeh
|
|
منبع
|
aut journal of mathematics and computing - 2020 - دوره : 1 - شماره : 2 - صفحه:263 -270
|
|
چکیده
|
Let g = (v, e) be a simple graph without isolated vertices. a set d ⊂ v is a total [1, 2]-dominating set if for every vertex v ∈ v , 1 ≤ |n(v) ∩ d| ≤ 2. the total [1, 2]-domination problem is to determine the total [1, 2]-domination number γt[1,2](g), which is the minimum cardinality of a total [1, 2]-dominating set for a graph g. in this paper, we present a linear-time algorithm to compute γt[1,2](g) for a block graph g.
|
|
کلیدواژه
|
total [1; 2]-set ,dominating set ,block graph
|
|
آدرس
|
yazd university, department of mathematics, iran, university of mohaghegh ardabili, department of computer science, iran. yazd university, department of computer science, iran, institute for research in fundamental sciences (ipm), iran. yazd university, department of computer science, iran
|
|
پست الکترونیکی
|
pouyeh.sharifani@gmail.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|