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: | Septiadi, Irwan |
---|---|
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 |
Similar Items
-
THE TOTAL IRREGULARITY STRENGTH OF SOME CLASSES OF GRAPHS AND GRAPHS OBTAINED FROM CERTAIN OPERATION
by: RAMDANI , RISMAWATI -
TOTAL VERTEX IRREGULARITY STRENGTH OF CUBIC GRAPHS
by: Rikayanti -
Generalized Arithmetic Staircase Graphs and Their Total Edge Irregularity Strengths
by: Susanti, Yeni, et al.
Published: (2022) -
ON THE TOTAL IRREGULARITY STRENGTH OF AMALGAMATION OF STARS, BANANA TREES, AND FRIENDSHIP GRAPHS
by: IMELDA TILUKAY (NIM: 20110023), MEILIN -
ON THE TOTAL VERTEX IRREGULARITY STRENGTH OF CARTESIAN PRODUCT GRAPH OF PN AND CM
by: Tumpi Nagari, Grita