On the complexity of signed and minus total domination in graphs

Authors:
Chuan-Min Lee
Affiliations:
Department of Computer and Communication Engineering, Ming Chuan University, 5 De Ming Rd., Guishan District, Taoyuan County 333, Taiwan
Venue:
Information Processing Letters
Year:
2009

Citing 6
Cited 1

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Three partition refinement algorithms

SIAM Journal on Computing
Doubly lexical ordering of dense 0–1 matrices

Information Processing Letters
Dually Chordal Graphs

SIAM Journal on Discrete Mathematics
Graph classes: a survey

Graph classes: a survey
Upper bounds on the upper signed total domination number of graphs

Discrete Applied Mathematics

Computing a minimum outer-connected dominating set for the class of chordal graphs

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.