Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
type: Item
instance of: scholarly article
title: Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
zbMATH Open document ID: 1386.05137
author: Peng Zhang
published in: Journal of Combinatorial Optimization
publication date: 2018-03-01T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6845573
zbMATH Keywords: neighborhood total domination
zbMATH Keywords: algorithm complexity
zbMATH Keywords: labeled graph
MaRDI profile type: Publication
full work available at URL: s10878-017-0181-6
OpenAlex ID: W2761771983
cites work: Neighbourhood total domination in graphs
cites work: Dominating sets for split and bipartite graphs
cites work: Hardness results and approximation algorithms for (weighted) paired-domination in graphs
cites work: Q4506068
cites work: Total domination in graphs
cites work: Construction of trees and graphs with equal domination parameters
cites work: Q3791165
cites work: Characterizations of trees with equal domination parameters
cites work: Q4368728
cites work: Q4368729
cites work: A survey of selected recent results on total domination in graphs
cites work: Trees with large total domination number
cites work: A Transition from Total Domination in Graphs to Transversals in Hypergraphs
cites work: Bounds on neighborhood total domination in graphs
DOI: 10.1007/S10878-017-0181-6
description: scientific article; zbMATH DE number 6845573