The subdivision graph of a graceful tree is a graceful tree (Q1381864): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Marco Burzio / rank | |||
Property / author | |||
Property / author: Giorgio Ferrarese / rank | |||
Property / reviewed by | |||
Property / reviewed by: Hans L. Bodlaender / rank | |||
Revision as of 18:29, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The subdivision graph of a graceful tree is a graceful tree |
scientific article |
Statements
The subdivision graph of a graceful tree is a graceful tree (English)
0 references
10 December 1998
0 references
A graph \(G= (V,E)\) is graceful, if there is a numbering \(f\) of the vertices from \(1\) to \(| V|\), such that all values \(| f(v)- f(w)|\) are distinct for all edges \(\{v,w\}\in E\). The subdivision graph of a graph is obtained by adding a vertex on the middle of each edge. It is shown that the subdivision graph of a graceful tree is also graceful. The same result holds if exactly \(n\) vertices are inserted on each edge of a graceful tree. The result does not generalize to arbitrary graphs.
0 references
subdivision graph
0 references
graceful tree
0 references