On b-edge consecutive edge magic total labeling on trees
| Main Authors: | Setiawan, Eunike; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, , Indonesia, Sugeng, Kiki Ariyanti; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, Indonesia Center for Research Collaboration on Graph Theory and Combinatorics, Indonesia, Silaban, Denny Riama; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, Indonesia Center for Research Collaboration on Graph Theory and Combinatorics, Indonesia |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2022
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1585 https://www.ejgta.org/index.php/ejgta/article/view/1585/pdf_248 |
Daftar Isi:
- Let G = (V, E) be a simple, connected, and undirected graph, where V and E are the set of vertices and the set of edges of G. An edge magic total labeling on G is a bijection f : V ∪ E → {1, 2, ..., |V|+|E|}, provided that for every uv ∈ E, w(uv)=f(u)+f(v)+f(uv)=K for a constant number K. Such a labeling is said to be a super edge magic total labeling if f(V)={1,2,...,|V|} and a b-edge consecutive edge magic total labeling if f(E)={b+1,b+2,...,b+|E|} with b ≥ 1. In this research, we give sufficient conditions for a graph G having a super edge magic total labeling to have a b-edge consecutive edge magic total labeling. We also give several classes of connected graphs which have both labelings.