Complexity of certain functional variants of total domination in chordal bipartite graphs
DOI10.1142/S1793830912500450zbMATH Open1251.05127OpenAlexW2140661653MaRDI QIDQ3166754FDOQ3166754
Authors:
Publication date: 15 October 2012
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830912500450
Recommendations
- On the complexity of signed and minus total domination in graphs
- Total dominating functions on subclasses of chordal graphs
- scientific article; zbMATH DE number 2104725
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Domination in convex and chordal bipartite graphs
dominationNP-completetotal domination\(k\)-tuple total dominationminus total dominationsigned total domination
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Incidence matrices and interval graphs
- 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
- \(k\)-tuple total domination in graphs
- Remarks on the minus (signed) total domination in graphs
- Dually Chordal Graphs
- Domination in convex and chordal bipartite graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Classes of bipartite graphs related to chordal graphs
- Upper minus total domination in small-degree regular graphs
- Total minus domination in \(k\)-partite graphs
- Upper bounds on the upper signed total domination number of graphs
- On the complexity of signed and minus total domination in graphs
Cited In (11)
- Algorithms and complexity of signed, minus, and majority domination
- On the algorithmic complexity of \(k\)-tuple total domination
- The cyclic rank completion problem with general blocks
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
- \(R\)-total domination on convex bipartite graphs
- On the complexity of signed and minus total domination in graphs
- Total dominating functions on subclasses of chordal graphs
- An efficient algorithm for distance total domination in block graphs
- k-Efficient domination: Algorithmic perspective
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Complexity of certain functional variants of total domination in chordal bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166754)
