On full-separating sets in graphs

DOI10.1007/978-3-031-83438-7_7MaRDI QIDQ6969508zbMATH OpenFDO

Authors Dipayan Chakraborty, Annegret K. Wagler

Publication date 20 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-83438-7_7

zbMATH Keywords

closed-separationdominationfull-separationhypergraphNP-completenessopen-separationtotal-domination

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• Characterizing extremal graphs for open neighbourhood location-domination
• scientific article; zbMATH DE number 5717189 (Why is no real title available?)
• scientific article; zbMATH DE number 4053685 (Why is no real title available?)
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• Locating and total dominating sets in trees
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• On a new class of codes for identifying vertices in graphs
• On strongly identifying codes
• Open-separating dominating codes in graphs
• Polyhedra associated with identifying codes in graphs
• Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
• Progress on the description of identifying code polyhedra for some families of split graphs

Cited in

(1)

• On full-separating sets and related codes in graphs

This page was built for publication: On full-separating sets in graphs

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