Algorithm complexity of neighborhood total domination and (,_nt)-graphs

DOI10.1007/S10878-017-0181-6MaRDI QIDQ1702824zbMATH OpenOpenAlexFDO

Authors Peng Zhang

Publication date 1 March 2018

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-017-0181-6

zbMATH Keywords

algorithm complexitylabeled graphneighborhood total domination

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Algorithm and hardness results on neighborhood total domination in graphs
• Bounds on neighborhood total domination in graphs
• Trees with large neighborhood total domination number
• A note on neighborhood total domination in graphs
• Algorithmic aspects of disjunctive total domination in graphs

Cites work

• A survey of selected recent results on total domination in graphs
• A Transition from Total Domination in Graphs to Transversals in Hypergraphs
• Bounds on neighborhood total domination in graphs
• Characterizations of trees with equal domination parameters
• Construction of trees and graphs with equal domination parameters
• Dominating sets for split and bipartite graphs
• Hardness results and approximation algorithms for (weighted) paired-domination in graphs
• scientific article; zbMATH DE number 4055636 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1507962 (Why is no real title available?)
• Neighbourhood total domination in graphs
• Total domination in graphs
• Trees with large total domination number

Cited in

(3)

• Double vertex-edge domination in graphs: complexity and algorithms
• Algorithm and hardness results on neighborhood total domination in graphs
• Algorithmic and NP-completeness aspects of a total lict domination number of a graph

This page was built for publication: Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702824)