INDEPENDENT [1,2]-SET IN SEVERAL COMB EDGE GRAPH
Let ???? be a simple graph with vertex and edge sets ????(????) and ????(????) respectively. Suppose ?????????(????). The set ???? is called a independent [1,2]-set of ???? if any two distinct vertices in ???? are not adjacent, and every vertex ?????????(????)????? is adjacent to exactly one or two...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/85824 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |