On the complexity of signed and minus total domination in graphs
DOI10.1016/J.IPL.2009.08.002zbMATH Open1206.68238OpenAlexW2080793356MaRDI QIDQ990954FDOQ990954
Authors: Chuan-Min Lee 
Publication date: 1 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.08.002
Recommendations
- Signed and minus total domination on subclasses of bipartite graphs.
- Total dominating functions on subclasses of chordal graphs
- scientific article; zbMATH DE number 2080250
- Complexity of certain functional variants of total domination in chordal bipartite graphs
- Efficient minus and signed domination in graphs
graph algorithmschordal bipartite graphsdoubly chordal graphsminus total dominating functionssigned total dominating functions
Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Classes: A Survey
- On the Algorithmic Complexity of Total Domination
- A survey of selected recent results on total domination in graphs
- Signed total domination in graphs.
- Doubly lexical ordering of dense 0--1 matrices
- Signed Total Domination Nnumber of a Graph
- Three Partition Refinement Algorithms
- Remarks on the minus (signed) total domination in graphs
- Characterizations of strongly chordal graphs
- Triangulated graphs and the elimination process
- Dually Chordal Graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- An upper bound on the restrained domination number of graphs.
- Upper minus total domination in small-degree regular graphs
- Title not available (Why is that?)
- Total minus domination in \(k\)-partite graphs
- Doubly chordal graphs, steiner trees, and connected domination
- Variations of \(Y\)-dominating functions on graphs
- Upper bounds on the upper signed total domination number of graphs
Cited In (12)
- Algorithms and complexity of signed, minus, and majority domination
- Kernelization and Lower Bounds of the Signed Domination Problem
- Efficient minus and signed domination in graphs
- The algorithmic complexity of minus domination in graphs
- Title not available (Why is that?)
- Complexity of certain functional variants of total domination in chordal bipartite graphs
- Algorithms and Hardness for Signed Domination
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Total dominating functions on subclasses of chordal graphs
- Signed and minus total domination on subclasses of bipartite graphs.
- Remarks on the complexity of signed \(k\)-independence on graphs.
- Title not available (Why is that?)
This page was built for publication: On the complexity of signed and minus total domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990954)
