D-ANTIMAGIC LABELING ON ORIENTED GRAPHS
Let ??G be an oriented graph with vertex set V ( ??G ) and arc set A( ??G ). Suppose that D ? {0, 1, 2, . . . , ?} is a distance set where ? = max{d(u, v) < ?|u, v ? V ( ??G )}. Given a bijection h : V ( ??G ) ? {1, 2, , . . . , |V ( ??G )|}, the D-neighborhood weight of a vertex v ? V (...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/74548 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |