Minimum sizes of identifying codes in graphs differing by one vertex
From MaRDI portal
(Redirected from Publication:2392684)
Recommendations
- Minimum sizes of identifying codes in graphs differing by one edge
- On the number of optimal identifying codes in a twin-free graph
- Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
- Structural properties of twin-free graphs
- On the ensemble of optimal identifying codes in a twin-free graph
Cites work
- scientific article; zbMATH DE number 5360704 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 5228468 (Why is no real title available?)
- An optimal edge-robust identifying code in the triangular lattice
- Extremal cardinalities for identifying and locating-dominating codes in graphs
- Extremal graphs for the identifying code problem
- Identifying and locating-dominating codes on chains and cycles
- Identifying codes and locating-dominating sets on paths and cycles
- Locating sensors in paths and cycles: the case of 2-identifying codes
- Minimum sizes of identifying codes in graphs differing by one edge
- On 2-edge robust \(r\)-identifying codes in the king grid
- On a new class of codes for identifying vertices in graphs
- On graphs having a \(V\setminus \{x\}\) set as an identifying code
- On identifying codes that are robust against edge changes
- On the Structure of Identifiable Graphs
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
- Structural properties of twin-free graphs
Cited in
(13)- Structural properties of twin-free graphs
- Locating-domination and identification
- On the ensemble of optimal identifying codes in a twin-free graph
- Optimal identification of sets of edges using 2-factors
- On Iiro Honkala's contributions to identifying codes
- Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
- Minimum sizes of identifying codes in graphs differing by one edge
- Identifying codes with small radius in some infinite regular graphs
- Induced paths in twin-free graphs
- On the number of optimal identifying codes in a twin-free graph
- A comparison of approaches for finding minimum identifying codes on graphs
- Minimum identifying codes in some graphs differing by matchings
- Commutative rings introduce a class of identifiable graphs
This page was built for publication: Minimum sizes of identifying codes in graphs differing by one vertex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392684)
