Graphs whose vertices are graphs with bounded degree: Distance problems (Q1272673)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs whose vertices are graphs with bounded degree: Distance problems |
scientific article; zbMATH DE number 1234873
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs whose vertices are graphs with bounded degree: Distance problems |
scientific article; zbMATH DE number 1234873 |
Statements
Graphs whose vertices are graphs with bounded degree: Distance problems (English)
0 references
9 May 1999
0 references
The distance between two graphs of \(n\) vertices, all of degree bounded by \(f\), is the minimal number of edge-deletions and/or insertions needed to transform one into the other. The paper gives an overview of known results and many new ones with respect to the maximum distance between two graphs in function of parameters \(n\) and \(f\). Several open questions remain.
0 references
graph distance
0 references
diameter
0 references
