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.

• More results on the complexity of identifying problems in graphs (Q264560) (← links)
• On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
• On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
• On the covering of vertices for fault diagnosis in hypercubes (Q294624) (← links)
• A comparison of approaches for finding minimum identifying codes on graphs (Q296102) (← links)
• Inapproximability of the lid-chromatic number (Q324747) (← links)
• Some links between identifying codes and separating, dominating and total dominating sets in graphs (Q324774) (← links)
• Relaxed locally identifying coloring of graphs (Q343700) (← links)
• Identifying path covers in graphs (Q396675) (← links)
• Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
• The minimum identifying code graphs (Q423972) (← 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)
• Maximum size of a minimum watching system and the graphs achieving the bound (Q496659) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
• Information retrieval and the average number of input clues (Q514538) (← links)
• Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
• Identifying codes for infinite triangular grids with a finite number of rows (Q526246) (← links)
• On binary linear \(r\)-identifying codes (Q540477) (← links)
• Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
• Partial linear spaces and identifying codes (Q627920) (← links)
• Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
• Open neighborhood locating-dominating in trees (Q628345) (← links)
• Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
• Centroidal localization game (Q668034) (← links)
• On identifying codes in binary Hamming spaces (Q696908) (← links)
• Simultaneous resolvability in families of corona product graphs (Q723627) (← links)
• Various bounds for liar's domination number (Q726641) (← links)
• Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
• Combinatorial identification problems and graph powers (Q766254) (← links)
• On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
• On locating--dominating sets in infinite grids (Q819007) (← links)
• Recursive methods for some problems in coding and random permutations (Q831746) (← links)
• On a new class of identifying codes in graphs (Q845971) (← links)
• Constructing codes identifying sets of vertices (Q851780) (← links)
• A family of optimal identifying codes in \(\mathbb Z^2\) (Q855875) (← links)
• On robust identification in the square and King grids (Q860410) (← links)
• Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121) (← links)
• On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130) (← links)
• Codes identifying sets of vertices in random networks (Q870971) (← links)
• Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
• Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
• Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
• Graph classes with and without powers of bounded clique-width (Q896650) (← links)
• Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
• Discriminating codes in (bipartite) planar graphs (Q925038) (← links)
• Identifying codes of cycles with odd orders (Q942141) (← links)
• New bounds on binary identifying codes (Q947104) (← links)
• Adaptive identification in graphs (Q958720) (← links)
• Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)