Pages that link to "Item:Q4400275"

The following pages link to On a new class of codes for identifying vertices in graphs (Q4400275):

Displaying 50 items.

• The watching system as a generalization of identifying code (Q2180726) (← 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)
• Identifying codes in line digraphs (Q2189840) (← links)
• Fault tolerance of hypercube like networks: spanning laceability under edge faults (Q2192380) (← links)
• Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
• Covering codes of a graph associated with a finite vector space (Q2214154) (← links)
• A note on \(k\)-metric dimensional graphs (Q2217503) (← links)
• Locating and identifying codes in circulant graphs (Q2244371) (← links)
• New results of identifying codes in product graphs (Q2245049) (← links)
• Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
• On \(t\)-revealing codes in binary Hamming spaces (Q2272993) (← links)
• On two variations of identifying codes (Q2275454) (← links)
• Tolerant location detection in sensor networks (Q2280052) (← links)
• The compared costs of domination location-domination and identification (Q2282469) (← links)
• Constructions of \(r\)-identifying codes and \((r, \leq l)\)-identifying codes (Q2283219) (← 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)
• Information retrieval with unambiguous output (Q2346418) (← links)
• Identifying codes of degree 4 Cayley graphs over abelian groups (Q2346707) (← links)
• Optimal open-locating-dominating sets in infinite triangular grids (Q2354721) (← links)
• Identifying codes and searching with balls in graphs (Q2355743) (← links)
• On identifying codes that are robust against edge changes (Q2373878) (← links)
• Watching systems in the King grid (Q2376080) (← links)
• Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
• Approximability of identifying codes and locating-dominating codes (Q2379937) (← links)
• New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (Q2380847) (← links)
• Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
• Partition dimension of projective planes (Q2400970) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
• On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
• A Vizing-like theorem for union vertex-distinguishing edge coloring (Q2410224) (← links)
• The number of completely different optimal identifying codes in the infinite square grid (Q2410258) (← links)
• A linear-time algorithm for the identifying code problem on block graphs (Q2413180) (← links)
• Identifying codes on directed de Bruijn graphs (Q2416416) (← links)
• Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997) (← links)
• List-distinguishing Cartesian products of cliques (Q2421867) (← links)
• On cages admitting identifying codes (Q2426452) (← links)
• Extremal graphs for the identifying code problem (Q2430979) (← links)
• An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
• Sphere coverings and identifying codes (Q2436572) (← links)
• An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid (Q2437959) (← links)
• Choice identification of a graph (Q2440100) (← links)
• Identifying codes of the direct product of two cliques (Q2441624) (← links)
• Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← links)
• Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid (Q2444553) (← links)
• Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
• Locating and identifying codes in circulant networks (Q2446842) (← links)
• New lower bound for 2-identifying code in the square grid (Q2446847) (← links)