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: | |
|---|---|
| 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 |
| id |
id-itb.:36300 |
|---|---|
| spelling |
id-itb.:363002019-03-11T14:28:19ZDISTANCE MAGIC LABELING ON DISTANCE-REGULAR GRAPH AND GRAPH FROM PRODUCTS GRAPH Wayan Palton Anuwiksa, I Indonesia Theses distance magic labeling, distance-regular graph, strongly regular graph, line graph, antipodal double cover, product of graph. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/36300 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 = f1g, D-distance magic labeling is called distance magic labeling. The main objective of this thesis is the existence of distance magic labeling on distance-regular graphs and products of graphs. Products of graphs considered are lexicographic product and kronecker product. By using a matrix with particular properties, distance magic labelings of some products of graph are obtained. By considering antipodal double cover graph as a distance-regular graph, the existence of D-distance magic labeling for the antipodal double cover graph is obtained. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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 = f1g, D-distance magic labeling is
called distance magic labeling.
The main objective of this thesis is the existence of distance magic labeling on
distance-regular graphs and products of graphs. Products of graphs considered
are lexicographic product and kronecker product. By using a matrix with particular
properties, distance magic labelings of some products of graph are obtained.
By considering antipodal double cover graph as a distance-regular graph, the existence
of D-distance magic labeling for the antipodal double cover graph is obtained. |
| format |
Theses |
| author |
Wayan Palton Anuwiksa, I |
| spellingShingle |
Wayan Palton Anuwiksa, I DISTANCE MAGIC LABELING ON DISTANCE-REGULAR GRAPH AND GRAPH FROM PRODUCTS GRAPH |
| author_facet |
Wayan Palton Anuwiksa, I |
| author_sort |
Wayan Palton Anuwiksa, I |
| title |
DISTANCE MAGIC LABELING ON DISTANCE-REGULAR GRAPH AND GRAPH FROM PRODUCTS GRAPH |
| title_short |
DISTANCE MAGIC LABELING ON DISTANCE-REGULAR GRAPH AND GRAPH FROM PRODUCTS GRAPH |
| title_full |
DISTANCE MAGIC LABELING ON DISTANCE-REGULAR GRAPH AND GRAPH FROM PRODUCTS GRAPH |
| title_fullStr |
DISTANCE MAGIC LABELING ON DISTANCE-REGULAR GRAPH AND GRAPH FROM PRODUCTS GRAPH |
| title_full_unstemmed |
DISTANCE MAGIC LABELING ON DISTANCE-REGULAR GRAPH AND GRAPH FROM PRODUCTS GRAPH |
| title_sort |
distance magic labeling on distance-regular graph and graph from products graph |
| url |
https://digilib.itb.ac.id/gdl/view/36300 |
| _version_ |
1822924601078841344 |