On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.09.035 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004251646 / rank | |||
Normal 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 | |||
Revision as of 13:06, 25 June 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
