Alternative construction of graceful symmetric trees

I. P. Sandy, A. Rizal, E. N. Manurung, Kiki Ariyanti

Research output: Contribution to journalConference articlepeer-review

Abstract

Graceful labeling is one of the interesting topics in graph theory. Let G = (V;E) be a tree. The injective mapping f : V → {0; 1; ⋯ |E|} is called graceful if the weight of edge w(xy) = |f(x) - f(y)| are all difierent for every edge xy. The famous conjecture in this area is all trees are graceful. In this paper we give alternative construction of graceful labeling on symmetric tree using adjacency matrix.

Original languageEnglish
Article number012031
JournalJournal of Physics: Conference Series
Volume1008
Issue number1
DOIs
Publication statusPublished - 27 Apr 2018
Event1st International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2017 - Jember, East Java, Indonesia
Duration: 25 Nov 201726 Nov 2017

Fingerprint

Dive into the research topics of 'Alternative construction of graceful symmetric trees'. Together they form a unique fingerprint.

Cite this