The subdivision graph of a graceful tree is a graceful tree (Q1381864): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3892270 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3199452 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey: Recent results, conjectures, and open problems in labeling graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two theorems on graceful trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5589124 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The factorial representation of balanced labelled graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(97)00069-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2170457172 / rank | |||
Normal rank |
Latest revision as of 12:10, 30 July 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