Exact values for three domination-like problems in circular and infinite grid graphs of small height
Copyright policy )Exact values for three domination-like problems in circular and infinite grid graphs of small height
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the minimum cardinality of such codes in circular and infinite grid graphs of given height. We provide an alternate proof for already known results, as well as new results. These were obtained by a computer search based on a generic framework, that we developed earlier, for the search of a minimum labeling satisfying a pseudo-d-local property in rotagraphs.
- Grenoble Alpes University France
- CNRS (LCP) France
- CNRS France
- Université de Toulouse (mauvais partenaire) France
- Grenoble INP - UGA France
FOS: Computer and information sciences, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.4: Path and circuit problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, Discrete Mathematics (cs.DM), acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.0: graph algorithms, locating-dominating code, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, grid, Graph labelling (graceful graphs, bandwidth, etc.), identifying code, [info.info-dm]computer science [cs]/discrete mathematics [cs.dm], Graph algorithms (graph-theoretic aspects), graph algorithm, QA1-939, acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory, Theory of error-correcting codes and error-detecting codes, 004, acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.1: graph labeling, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.4: path and circuit problems, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), locating-total-dominating code, Mathematics, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.4: Path and circuit problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.1: Graph labeling, Discrete Mathematics (cs.DM), acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.0: graph algorithms, locating-dominating code, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, grid, Graph labelling (graceful graphs, bandwidth, etc.), identifying code, [info.info-dm]computer science [cs]/discrete mathematics [cs.dm], Graph algorithms (graph-theoretic aspects), graph algorithm, QA1-939, acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory, Theory of error-correcting codes and error-detecting codes, 004, acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.1: graph labeling, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, acm: g.: mathematics of computing/g.2: discrete mathematics/g.2.2: graph theory/g.2.2.4: path and circuit problems, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), locating-total-dominating code, Mathematics, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!