Pages that link to "Item:Q1883609"
From MaRDI portal
The following pages link to Identifying and locating-dominating codes on chains and cycles (Q1883609):
Displaying 50 items.
- LD-graphs and global location-domination in bipartite graphs (Q283710) (← links)
- A polyhedral approach to locating-dominating sets in graphs (Q324734) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
- Partial linear spaces and identifying codes (Q627920) (← links)
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
- Identifying codes of cycles with odd orders (Q942141) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- Locating-dominating sets in hypergraphs (Q1677551) (← links)
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
- Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
- Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
- Optimal identifying codes in cycles and paths (Q1926037) (← links)
- Bounds on the identifying codes in trees (Q2000553) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- On locating-dominating set of regular graphs (Q2052122) (← links)
- Locating and identifying codes in dihedral graphs (Q2060210) (← links)
- Open locating-dominating sets in circulant graphs (Q2062672) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- Covering codes of a graph associated with a finite vector space (Q2214154) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- Locating-dominating codes in paths (Q2275442) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- Locating-dominating sets of functigraphs (Q2333813) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- Locating-paired-dominating sets in square grids (Q2346332) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- A linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
- Locating domination in bipartite graphs and their complements (Q2420423) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)