Algorithmic results on locating-total domination in graphs

DOI10.1016/j.dam.2023.03.007zbMath1514.05124OpenAlexW4327630313MaRDI QIDQ6157416

Abolfazl Poureidi, Mohammad Farshi

Publication date: 11 May 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.007

zbMATH Keywords

algorithmNP-completenessdominating setlocating-total dominating set

Mathematics Subject Classification ID

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

Cites Work

• Graphs of separability at most 2
• Locating-total domination in graphs
• Locating-total domination in claw-free cubic graphs
• Bounds on the locating-total domination number of a tree
• Optimization, approximation, and complexity classes
• The complexity of domination problems in circle graphs
• Approximation algorithms for combinatorial problems
• Some APX-completeness results for cubic graphs
• A note on the complexity of locating-total domination in graphs
• A note on the locating-total domination in graphs
• Locating and total dominating sets in trees

This page was built for publication: Algorithmic results on locating-total domination in graphs