|
|
|
|
algorithmic aspects of certified domination in graphs
|
|
|
|
|
|
|
|
نویسنده
|
kumar jakkepalli pavan ,arumugam subramanian ,khandelwal himanshu ,reddy p. venkata subba
|
|
منبع
|
communications in combinatorics and optimization - 2022 - دوره : 7 - شماره : 2 - صفحه:247 -255
|
|
چکیده
|
A dominating set d of a graph g=(v,e) is called a certified dominating set of g if |n(v)∩(v∖d)| is either 0 or at least 2 for all v∈d. the certified domination number γcer(g) is the minimum cardinality of a certified dominating set of g. in this paper, we prove that the decision problem corresponding to γcer(g) is np-complete for split graphs, star convex bipartite graphs, comb convex bipartite graphs and planar graphs. we also prove that it is linear time solvable for chain graphs, threshold graphs and bounded tree-width graphs.
|
|
کلیدواژه
|
certified domination ,np-complete ,tree-convex bipartite graphs
|
|
آدرس
|
icfai foundation for higher education, icfaitech (faculty of science & technology), india, kalasalingam academy of research and education, india, national institute of technology, department of computer science and engineering, india, national institute of technology, department of computer science and engineering, india
|
|
پست الکترونیکی
|
pvsr@nitw.ac.in
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|