Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s12095-012-0078-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4244127482 / rank | |||
Normal rank | |||
Revision as of 21:12, 19 March 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
