On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs

DOI10.1016/j.ipl.2021.106178OpenAlexW3194658798MaRDI QIDQ2059873

Ramesh K. Jallu, Gautam K. Das, Sangram K. Jena

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.11416

zbMATH Keywords

NP-hardapproximation algorithmsinapproximabilityliar's domination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Liar's dominating sets in graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• \(k\)-tuple domination in graphs
• Liar's domination in graphs
• Liar's domination in graphs: complexity and algorithm
• Hardness results, approximation and exact algorithms for liar's domination problem in graphs
• A linear time algorithm for liar's domination problem in proper interval graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Liar's domination
• Analytical approach to parallel repetition

This page was built for publication: On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs