Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Iiro S. Honkala / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Antoine C. Lobstein / rank | |||
Normal rank | |||
Revision as of 13:01, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum sizes of identifying codes in graphs differing by one vertex |
scientific article |
Statements
Minimum sizes of identifying codes in graphs differing by one vertex (English)
0 references
2 August 2013
0 references
graph theory
0 references
twin-free graphs
0 references
identifiable graphs
0 references
identifying codes
0 references
