On the complexity of signed and minus total domination in graphs
From MaRDI portal
Publication:990954
DOI10.1016/j.ipl.2009.08.002zbMath1206.68238OpenAlexW2080793356MaRDI QIDQ990954
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
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)
Related Items (3)
COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS ⋮ Computing a minimum outer-connected dominating set for the class of chordal graphs ⋮ Algorithms and Complexity of Signed, Minus, and Majority Domination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Remarks on the minus (signed) total domination in graphs
- Variations of \(Y\)-dominating functions on graphs
- A survey of selected recent results on total domination in graphs
- Upper bounds on the upper signed total domination number of graphs
- Characterizations of strongly chordal graphs
- Signed total domination in graphs.
- Doubly lexical ordering of dense 0--1 matrices
- Upper minus total domination in small-degree regular graphs
- Total minus domination in \(k\)-partite graphs
- Triangulated graphs and the elimination process
- Signed Total Domination Nnumber of a Graph
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- On the Algorithmic Complexity of Total Domination
- Three Partition Refinement Algorithms
- Dually Chordal Graphs
- Graph Classes: A Survey
- Doubly chordal graphs, steiner trees, and connected domination
This page was built for publication: On the complexity of signed and minus total domination in graphs
