scientific article; zbMATH DE number 7296943
From MaRDI portal
Publication:5144277
zbMath1474.05311MaRDI QIDQ5144277
Diana Grace Thomas, A. S. Shanthi
Publication date: 15 January 2021
Full work available at URL: http://rsmams.org/journals/articleinfo.php?articleid=462&tag=seajmams
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Liar's dominating sets 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
- Liar's domination
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
This page was built for publication: