On the Structure of Identifiable Graphs (Q3439386): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Identifying codes with small radius in some infinite regular graphs / 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 graphs having a \(V\setminus \{x\}\) set as an identifying code / 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 19:09, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Structure of Identifiable Graphs |
scientific article |
Statements
On the Structure of Identifiable Graphs (English)
0 references
29 May 2007
0 references
graph theory
0 references
codes
0 references
identifiable graphs
0 references
paths
0 references
trees
0 references
