Graceful labeling on torch graph
Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V<span style="font-family: symbol;"> --> </span>{0,1,2,...,|E|} is called graceful labeling if f induces a function f<sup>*</sup>(uv)=|f(u)<span style="font-family: s...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2018-06-01
|
| Series: | Indonesian Journal of Combinatorics |
| Subjects: | |
| Online Access: | http://www.ijc.or.id/index.php/ijc/article/view/33 |
| Summary: | Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V<span style="font-family: symbol;"> --> </span>{0,1,2,...,|E|} is called graceful labeling if f induces a function f<sup>*</sup>(uv)=|f(u)<span style="font-family: symbol;">-</span>f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}. A graph which admits a graceful labeling is called a graceful graph. In this paper, we show that torch graph O<sub>n</sub> is a graceful graph. |
|---|---|
| ISSN: | 2541-2205 |