Graph algorithms;
Minus total dominating functions;
Signed total dominating functions;
Chordal bipartite graphs;
Doubly chordal graphs;
NUMBER;
D O I:
10.1016/j.ipl.2009.08.002
中图分类号:
TP [自动化技术、计算机技术];
学科分类号:
0812 ;
摘要:
In this paper we present unified methods to solve the minus and signed total domination problems for chordal bipartite graphs and trees in O(n(2)) and O(n + m) time, respectively. We also prove that the decision problem for the signed total domination problem on doubly chordal graphs is NP-complete. Note that bipartite permutation graphs, biconvex bipartite graphs, and convex bipartite graphs are subclasses of chordal bipartite graphs. (c) 2009 Elsevier B.V. All rights reserved.