Liar's domination in graphs: complexity and algorithm
type: Item
instance of: scholarly article
title: Liar's domination in graphs: complexity and algorithm
zbMATH Open document ID: 1263.05074
author: B. S. Panda
author: S. Paul
published in: Discrete Applied Mathematics
publication date: 2013-04-25T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6157670
zbMATH Keywords: graph algorithm
zbMATH Keywords: NP-completeness
zbMATH Keywords: domination
zbMATH Keywords: Liar's domination
MaRDI profile type: Publication
full work available at URL: j.dam.2012.12.011
OpenAlex ID: W2052665499
cites work: Q3948568
cites work: Labeling algorithms for domination problems in sun-free chordal graphs
cites work: A linear algorithm for the domination number of a tree
cites work: Q4368729
cites work: Q4368728
cites work: The edge domination problem
cites work: Reducibility among Combinatorial Problems
cites work: On the Algorithmic Complexity of Total Domination
cites work: Algorithmic aspect of \(k\)-tuple domination in graphs.
cites work: Q3616664
cites work: Liar's domination in graphs
cites work: Liar's domination
DOI: 10.1016/J.DAM.2012.12.011
description: scientific article; zbMATH DE number 6157670