Towards the Graceful Tree Conjecture: A Survey

Mousa Alfalayleh; Ljiljana Brankovic; Helen Giggins; Md Zahidul Islam

Towards the Graceful Tree Conjecture: A Survey

Mousa Alfalayleh, Ljiljana Brankovic, Helen Giggins, Md Zahidul Islam

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,...,n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference between the two end-vertex labels. The Graceful Tree Conjecture states that all trees have a graceful labeling. In this survey we present known results towards proving the Graceful Tree Conjecture.

Original language	English
Title of host publication	Proceedings of the Fifteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2004)
Editors	Seok-Hee Hong
Place of Publication	Australia
Publisher	National ICT Australia
Pages	239-247
ISBN (Print)	186487628X
Publication status	Published - 31 Jul 2004
Event	AWOCA 2004: The Fifteenth Australasian Workshop on Combinatorial Algorithms - Ballina Beach Resort, Australia, Ballina, Australia Duration: 6 Jul 2004 → 9 Jul 2004

Conference

Conference	AWOCA 2004: The Fifteenth Australasian Workshop on Combinatorial Algorithms
City	Ballina, Australia
Period	6/07/04 → 9/07/04

Access to Document

https://hdl.handle.net/1959.11/63417

Handle.net

Persistent link

Cite this

@inproceedings{ed3f1db2265b43779e9014490988903d,

title = "Towards the Graceful Tree Conjecture: A Survey",

abstract = "A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set \{0, 1, 2,...,n\} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference between the two end-vertex labels. The Graceful Tree Conjecture states that all trees have a graceful labeling. In this survey we present known results towards proving the Graceful Tree Conjecture.",

author = "Mousa Alfalayleh and Ljiljana Brankovic and Helen Giggins and Islam, \{Md Zahidul\}",

year = "2004",

month = jul,

day = "31",

language = "English",

isbn = "186487628X",

pages = "239--247",

editor = "Seok-Hee Hong",

booktitle = "Proceedings of the Fifteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2004)",

publisher = "National ICT Australia",

note = "AWOCA 2004: The Fifteenth Australasian Workshop on Combinatorial Algorithms ; Conference date: 06-07-2004 Through 09-07-2004",

}

Alfalayleh, M, Brankovic, L, Giggins, H & Islam, MZ 2004, Towards the Graceful Tree Conjecture: A Survey. in S-H Hong (ed.), Proceedings of the Fifteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2004). National ICT Australia, Australia, pp. 239-247, AWOCA 2004: The Fifteenth Australasian Workshop on Combinatorial Algorithms, Ballina, Australia, 6/07/04. <https://hdl.handle.net/1959.11/63417>

Towards the Graceful Tree Conjecture: A Survey. / Alfalayleh, Mousa; Brankovic, Ljiljana; Giggins, Helen et al.
Proceedings of the Fifteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2004). ed. / Seok-Hee Hong. Australia: National ICT Australia, 2004. p. 239-247.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Towards the Graceful Tree Conjecture

T2 - AWOCA 2004: The Fifteenth Australasian Workshop on Combinatorial Algorithms

AU - Alfalayleh, Mousa

AU - Brankovic, Ljiljana

AU - Giggins, Helen

AU - Islam, Md Zahidul

PY - 2004/7/31

Y1 - 2004/7/31

N2 - A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,...,n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference between the two end-vertex labels. The Graceful Tree Conjecture states that all trees have a graceful labeling. In this survey we present known results towards proving the Graceful Tree Conjecture.

AB - A graceful labelling of an undirected graph G with n edges is a one-to-one function from the set of vertices of G to the set {0, 1, 2,...,n} such that the induced edge labels are all distinct. An induced edge label is the absolute value of the difference between the two end-vertex labels. The Graceful Tree Conjecture states that all trees have a graceful labeling. In this survey we present known results towards proving the Graceful Tree Conjecture.

M3 - Conference contribution

SN - 186487628X

SP - 239

EP - 247

BT - Proceedings of the Fifteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2004)

A2 - Hong, Seok-Hee

PB - National ICT Australia

CY - Australia

Y2 - 6 July 2004 through 9 July 2004

ER -

Towards the Graceful Tree Conjecture: A Survey

Abstract

Conference

Access to Document

Handle.net

Fingerprint

Cite this