#TITLE_ALTERNATIVE#
In this Final Project, we discuss combination labellings of graphs. A (p,q)-graph G is said a combination graph, if there a bijektive function from the vertex set {1; 2; 3; : : : ; p} such that edge values obtained by the number of combinations of the larger incident vertex value taken the smaller i...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/11069 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | In this Final Project, we discuss combination labellings of graphs. A (p,q)-graph G is said a combination graph, if there a bijektive function from the vertex set {1; 2; 3; : : : ; p} such that edge values obtained by the number of combinations of the larger incident vertex value taken the smaller incident vertex value at a time are distinct. In this Final Project, we proof that web graphs are combination graphs. |
|---|