Algorithmic results on locating-total domination in graphs

DOI10.1016/J.DAM.2023.03.007MaRDI QIDQ6157416zbMATH OpenOpenAlexFDO

Authors 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

algorithmdominating setNP-completenesslocating-total dominating set

Mathematics Subject Classification ID

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

Recommendations

• A note on the complexity of locating-total domination in graphs
• Locating-total domination in graphs
• A note on the locating-total domination in graphs
• Bounds on the locating-total domination number in trees
• A note on the locating-total domination in trees

Cites work

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

Cited in

(8)

• Progress towards the two-thirds conjecture on locating-total dominating sets
• Algorithmic aspects of open neighborhood location-domination in graphs
• Algorithmic and NP-completeness aspects of a total lict domination number of a graph
• A note on the locating-total domination in graphs
• A note on the complexity of locating-total domination in graphs
• An extension of locating-total domination problem and its complexity
• An efficient sum query algorithm for distance-based locally dominating functions
• Algorithm and hardness results on neighborhood total domination in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157416)