Minimum sizes of identifying codes in graphs differing by one edge (Q2016394): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:21, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum sizes of identifying codes in graphs differing by one edge |
scientific article |
Statements
Minimum sizes of identifying codes in graphs differing by one edge (English)
0 references
20 June 2014
0 references
graph theory
0 references
twin-free graphs
0 references
identifiable graphs
0 references
identifying codes
0 references
