DISTANCE MAGIC LABELING ON DISTANCE-REGULAR GRAPH AND GRAPH FROM PRODUCTS GRAPH
LetGbe a graph with order n and diameter d. LetD f0; 1; 2; :::; dg andND(v) = fu 2 V (G)jd(u; v) 2 Dg, where v 2 V (G). A bijection l : V (G) ????! f1; 2; :::; ng is calledD-distance P magic labeling of G if there is a nonnegative integer k such that u2ND(v) l(u) = k for every v 2 V (G). If D =...
Saved in:
Main Author: | Wayan Palton Anuwiksa, I |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/36300 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
DISTANCE MAGIC LABELING USING ALGEBRAIC APPROACH
by: Wayan Palton Anuwiksa, I -
D-DISTANCE MAGIC LABELLINGS ON GRAPHS
by: SYAUQI FAWWAZI, ZIYAD -
SIMULATED ANNEALING APPROACH FOR DISTANCE MAGIC LABELING ON REGULAR GRAPHS OF ORDER AT MOST 18
by: SOHIBUROYYAN (NIM: 20914301), ROBIETH -
Two distance-regular graphs
by: Brouwer, Andries E., et al.
Published: (2013) -
On tight distance-regular graphs
by: Sinlao, Rowena A.
Published: (2000)