ON THE TOTAL C3-IRREGULARITY STRENGTH OF SOME CLASSES OF GRAPHS
Let G = (V,E) be a graph admitting an H-covering. A labeling l that sends all elements of V(G) [ E(G) to a set of natural number less than or equal to k, l : V(G) [ E(G) ! f1, 2, 3, ..., kg, is called a total k-labeling. The weight of H0 that isomorphic to H is defined as wtl (H0) = åv2V(H0) l(v)...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/46441 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |