TOPOLOGICAL INTEGER ADDITIVE SET-LABELING IN STAR GRAPH
A topological set-labeling of a graph is a set-labeling ( ) ( ) where ( ( )) is a topology of a non-empty finite set and ( ) be its power set. An integer additive set-labeling is an injective function ( ) ( ) whose associated function ( ) ( ) is defined by ( ) ( ) ( ) ( ) for a finite non-negative i...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/33801 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | A topological set-labeling of a graph is a set-labeling ( ) ( ) where ( ( )) is a topology of a non-empty finite set and ( ) be its power set. An integer additive set-labeling is an injective function ( ) ( ) whose associated function ( ) ( ) is defined by ( ) ( ) ( ) ( ) for a finite non-negative integer set . A topological integer additive set-labeling of a graph is an integer additive set-labeling ( ) ( ) * + where ( ( )) is a topology of a non-empty non-negative integer set . a graph that satisfy a topological integer additive set-labeling is called topologically integer additive set-labeled graph or a TIASL graph. Given a non-empty non-negative integer set , a topological integer additive set-labeling can be done to a graph that meets some certain conditions. This final assignment will look for a set with a minimal order that satisfies TIASL for a star graph . |
|---|