On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2005.09.035 / rank | |||
| Property / cites work | |||
| Property / cites work: Extremal cardinalities for identifying and locating-dominating codes in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a new class of codes for identifying vertices in graphs / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2005.09.035 / rank | |||
Normal rank | |||
Latest revision as of 07:00, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On graphs having a \(V\setminus \{x\}\) set as an identifying code |
scientific article |
Statements
On graphs having a \(V\setminus \{x\}\) set as an identifying code (English)
0 references
13 February 2007
0 references
identifying codes
0 references
graph theory
0 references
