Alternative construction of graceful symmetric trees

I. P. Sandy; A. Rizal; E. N. Manurung; K. A. Sugeng

doi:10.1088/1742-6596/1008/1/012031

Alternative construction of graceful symmetric trees

I. P. Sandy, A. Rizal, E. N. Manurung, K. A. Sugeng

Department of Mathematics

Research output: Contribution to journal › Conference article › peer-review

3 Citations (Scopus)

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 language	English
Article number	012031
Journal	Journal of Physics: Conference Series
Volume	1008
Issue number	1
DOIs	https://doi.org/10.1088/1742-6596/1008/1/012031
Publication status	Published - 27 Apr 2018
Event	1st International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2017 - Jember, East Java, Indonesia Duration: 25 Nov 2017 → 26 Nov 2017

Access to Document

10.1088/1742-6596/1008/1/012031

Cite this

@article{69fa527a79624500a767f59cce050aac,

title = "Alternative construction of graceful symmetric trees",

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.",

author = "Sandy, {I. P.} and A. Rizal and Manurung, {E. N.} and Sugeng, {K. A.}",

note = "Publisher Copyright: {\textcopyright} Published under licence by IOP Publishing Ltd.; 1st International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2017 ; Conference date: 25-11-2017 Through 26-11-2017",

year = "2018",

month = apr,

day = "27",

doi = "10.1088/1742-6596/1008/1/012031",

language = "English",

volume = "1008",

journal = "Journal of Physics: Conference Series",

issn = "1742-6588",

publisher = "IOP Publishing Ltd.",

number = "1",

}

TY - JOUR

T1 - Alternative construction of graceful symmetric trees

AU - Sandy, I. P.

AU - Rizal, A.

AU - Manurung, E. N.

AU - Sugeng, K. A.

N1 - Publisher Copyright: © Published under licence by IOP Publishing Ltd.

PY - 2018/4/27

Y1 - 2018/4/27

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85047398664&partnerID=8YFLogxK

U2 - 10.1088/1742-6596/1008/1/012031

DO - 10.1088/1742-6596/1008/1/012031

M3 - Conference article

AN - SCOPUS:85047398664

SN - 1742-6588

VL - 1008

JO - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

IS - 1

M1 - 012031

T2 - 1st International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2017

Y2 - 25 November 2017 through 26 November 2017

ER -

Alternative construction of graceful symmetric trees

Abstract

Access to Document

Other files and links

Fingerprint

Cite this