D-ANTIMAGIC LABELING FOR HYPERCUBES
Let G = (V;E) be a graph with order n, and let f : V (G) ! f1; 2; :::; ng be a bijection. Define a distance set, D f0; 1; 2; : : : ; diam(G)g. For each vertex v 2 V (G), the sum of its D-neighborhood labels u2ND(v)f(u) is called as the D- weight of v denoted by wD(v). If wD(x) 6= wD(y), for each...
Saved in:
Main Author: | |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/46381 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Be the first to leave a comment!