Title of article
algorithmic aspects of certified domination in graphs
Author/Authors
kumar, jakkepalli pavan icfai foundation for higher education - icfaitech (faculty of science technology), hyderabad, india , arumugam, subramanian kalasalingam academy of research and education, krishnankoil, india , khandelwal, himanshu national institute of technology - department of computer science and engineering, warangal, india , reddy, p. venkata subba national institute of technology - department of computer science and engineering, warangal, india
From page
247
To page
255
Abstract
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.
Keywords
certified domination , np , complete , tree , convex bipartite graphs
Journal title
Communications in Combinatorics and Optimization
Journal title
Communications in Combinatorics and Optimization
Record number
2704794
Link To Document