Pages that link to "Item:Q864130"

The following pages link to On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130):

Displaying 23 items.

• On the size of identifying codes in triangle-free graphs (Q427898) (← links)
• Maximum size of a minimum watching system and the graphs achieving the bound (Q496659) (← links)
• Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121) (← links)
• Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← 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)
• Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
• Strong identification codes for graphs (Q2037550) (← 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)
• Linear-time algorithms for three domination-based separation problems in block graphs (Q2184661) (← links)
• The compared costs of domination location-domination and identification (Q2282469) (← links)
• Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← 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)
• Extremal graphs for the identifying code problem (Q2430979) (← links)
• Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
• (Q2857369) (← links)
• Locating-Domination and Identification (Q3384611) (← links)
• On the Structure of Identifiable Graphs (Q3439386) (← links)
• Identifying Codes in Line Graphs (Q5325952) (← links)
• Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)