RELATION BETWEEN CHROMATIC NUMBER OF HYPERGRAPHS AND LARGEST EIGENVALUE OF HYPERMATRICES
Hypergraph is a generalization of the graph, that is one edge of the hypergraph can connect more than two vertices. Coloring on hypergraph is defined as the color on each vertex of the hypergraph such that there are at least two different colors in one edge. While the chromatic numbers on hypergr...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/44541 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
Be the first to leave a comment!