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.

• New identifying codes in the binary Hamming space (Q966160) (← links)
• Minimal identifying codes in trees and planar graphs with large girth (Q976158) (← links)
• Upper bounds for binary identifying codes (Q1012154) (← links)
• On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
• On the size of identifying codes in binary hypercubes (Q1024996) (← links)
• On identifying codes in the hexagonal mesh (Q1029036) (← links)
• Liar's domination in graphs (Q1045132) (← links)
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. (Q1401220) (← links)
• Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori (Q1406036) (← links)
• On the identification problems in products of cycles (Q1420607) (← links)
• The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
• Optimal codes for strong identification (Q1612759) (← links)
• Families of optimal codes for strong identification (Q1613402) (← links)
• Identification of points using disks (Q1618247) (← links)
• Paths and cycles identifying vertices in twisted cubes (Q1636884) (← links)
• On regular and new types of codes for location-domination (Q1671339) (← links)
• Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
• Separating codes and traffic monitoring (Q1704860) (← links)
• Periodicity of identifying codes in strips (Q1708274) (← links)
• Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← 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)
• Operads of finite posets (Q1753009) (← links)
• On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
• On identification in the triangular grid (Q1826954) (← links)
• On the density of identifying codes in the square lattice (Q1850615) (← links)
• Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
• Optimal identifying codes in cycles and paths (Q1926037) (← links)
• Bounds on the identifying codes in trees (Q2000553) (← links)
• On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
• Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
• Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
• Strong identification codes for graphs (Q2037550) (← links)
• Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
• Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
• Locating and identifying codes in dihedral graphs (Q2060210) (← links)
• Improved lower bound for locating-dominating codes in binary Hamming spaces (Q2068380) (← links)
• Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
• Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
• Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs (Q2091788) (← links)
• The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
• Identifying codes in the complementary prism of cycles (Q2132351) (← links)
• Open-independent, open-locating-dominating sets in complementary prism graphs (Q2132352) (← links)
• Extremal cubic graphs for fault-tolerant locating domination (Q2143147) (← links)
• On the watching number of graphs using discharging procedure (Q2143854) (← links)
• Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
• The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)