Identifying codes and locating-dominating sets on paths and cycles

From MaRDI portal
Publication:642979

DOI10.1016/J.DAM.2011.06.008zbMath1228.05225arXiv0908.2750OpenAlexW2099672440MaRDI QIDQ642979

Chunxia Chen, Chang-hong Lu, Zheng-Ke Miao

Publication date: 27 October 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.2750




Related Items (24)

LD-graphs and global location-domination in bipartite graphsThe identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operationsNew results on variants of covering codes in Sierpiński graphsMinimum sizes of identifying codes in graphs differing by one vertexOptimal identifying codes of two families of Cayley graphsDomination parameters in hypertrees and sibling treesImproved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubesSharp bound on the truncated metric dimension of treesLocating domination in bipartite graphs and their complementsSome rainbow problems in graphs have complexity equivalent to satisfiability problems\( [ 1 , 2 \)-dimension of graphs] ⋮ Locating-dominating codes: bounds and extremal cardinalitiesUnnamed ItemThe binary locating-dominating number of some convex polytopesIdentifying codes of the direct product of two cliquesLocating and identifying codes in circulant networksIdentifying codes in the direct product of a complete graph and some special graphsIdentifying codes of corona product graphsThe identifying code number and Mycielski's construction of graphsMinimum sizes of identifying codes in graphs differing by one edgeDomination Parameters in HypertreesLocating-Domination and IdentificationOptimal bounds on codes for location in circulant graphsLocating-paired-dominating sets in square grids




Cites Work




This page was built for publication: Identifying codes and locating-dominating sets on paths and cycles