Efficient Minus Domination on Proper Interval Graphs

• Main Authors: Bing-Heng Du, 杜秉恒
• Other Authors: Maw-Shang Chang
• Format: Others
• Language: en_US
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/19041527244346735516

碩士 === 國立中正大學 === 資訊工程研究所 === 90 === An efficient minus dominating function of a graph G = (V, E) is defined as a function f : V -> {-1, 0, 1} such that all sum of f(N[v]) = 1, where N[v] consists of v and all vertices adjacent to v. The efficient minus domination problem is to find an efficient minus dominating function of G. This problem is NP-hard for general graphs, even when restricted to chordal graphs, chordal bipartite graphs, planar bipartite graphs and planar graphs of maximum degree 4. In this paper, we present an O(n2) algorithm to solve the efficient minus domination problem on proper interval graphs.