Open-separating dominating codes in graphs
From MaRDI portal
Cites work
- Characterizing extremal graphs for open neighbourhood location-domination
- Combinatorial optimization. Packing and covering
- Facets and lifting procedures for the set covering polytope
- 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?)
- Induced subsets
- 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 the Complexity of Canonical Labeling of Strongly Regular Graphs
- On the set covering polyhedron of circulant matrices
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Polyhedra associated with identifying codes in graphs
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- The first order definability of graphs: Upper bounds for quantifier depth
Cited in
(3)
This page was built for publication: Open-separating dominating codes in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030728)
