The open-locating-dominating number of some convex polytopes
From MaRDI portal
Publication:5014387
Recommendations
- The binary locating-dominating number of some convex polytopes
- On open neighborhood locating-dominating in graphs
- The convex and weak convex domination number of convex polytopes
- Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
Cites work
- scientific article; zbMATH DE number 5717189 (Why is no real title available?)
- scientific article; zbMATH DE number 4070954 (Why is no real title available?)
- scientific article; zbMATH DE number 4081585 (Why is no real title available?)
- scientific article; zbMATH DE number 125446 (Why is no real title available?)
- scientific article; zbMATH DE number 6119641 (Why is no real title available?)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
- Domination and location in acyclic graphs
- On a new class of codes for identifying vertices in graphs
- On families of convex polytopes with constant metric dimension
- On open neighborhood locating-dominating in graphs
- On strongly identifying codes
- On the metric dimension of rotationally-symmetric convex polytopes
- Open locating-dominating interpolation for trees
- Open neighborhood locating-dominating in trees
- The binary locating-dominating number of some convex polytopes
Cited in
(8)- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
- The convex and weak convex domination number of convex polytopes
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- Computation of total chromatic number for certain convex polytope graphs
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
- The binary locating-dominating number of some convex polytopes
- Polyhedra associated with open locating-dominating and locating total-dominating sets in graphs
- Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs
This page was built for publication: The open-locating-dominating number of some convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014387)