Pages that link to "Item:Q864121"
From MaRDI portal
The following pages link to Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121):
Displaying 35 items.
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- 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)
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- Identification in \(\mathbb Z^2\) using Euclidean balls (Q628317) (← links)
- On the sizes of graphs and their powers: the undirected case (Q643002) (← links)
- Combinatorial identification problems and graph powers (Q766254) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130) (← links)
- Locating-dominating codes: bounds and extremal cardinalities (Q902474) (← links)
- New bounds on binary identifying codes (Q947104) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Optimal identifying codes in cycles and paths (Q1926037) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Locating-dominating codes in paths (Q2275442) (← links)
- The compared costs of domination location-domination and identification (Q2282469) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← 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)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- Locally identifying coloring in bounded expansion classes of graphs (Q2446886) (← links)
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367) (← links)
- (Q2857369) (← links)
- Identifying codes and watching systems in Kneser graphs (Q2966507) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- On the Structure of Identifiable Graphs (Q3439386) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- Minimum identifying codes in some graphs differing by matchings (Q4965914) (← links)
- (Q5135780) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
