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 |
| id |
id-itb.:44541 |
|---|---|
| spelling |
id-itb.:445412019-10-28T09:20:23ZRELATION BETWEEN CHROMATIC NUMBER OF HYPERGRAPHS AND LARGEST EIGENVALUE OF HYPERMATRICES Allan Juvito, Daniel Indonesia Theses hypermatrix, eigenvalue, block diagonal hypermatrix, hypergraph, uniform hypergraf, adjacency hypermatrix, chromatic number. INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/44541 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 hypergraph is the minimum number of colors to color the hypergraph. Uniform hypergraph is a hypergraph that each edge connecting the vertices by the same amount. Adjacency of uniform hypergraph can be encoded into hipermatrix and will be called as adjacency hipermatrix. The largest eigenvalue of hypergraph is the largest eigenvalue of its adjacency hipermatrix. The relationship between the largest eigenvalue of adjacency matrix of graph and its chromatic number remain fulfilled for the largest eigenvalue of adjacency hipermatrix of hypergraph and its chromatic number. text |
| institution |
Institut Teknologi Bandung |
| building |
Institut Teknologi Bandung Library |
| continent |
Asia |
| country |
Indonesia Indonesia |
| content_provider |
Institut Teknologi Bandung |
| collection |
Digital ITB |
| language |
Indonesia |
| description |
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 hypergraph is the minimum number of
colors to color the hypergraph.
Uniform hypergraph is a hypergraph that each edge connecting the vertices by the
same amount. Adjacency of uniform hypergraph can be encoded into hipermatrix
and will be called as adjacency hipermatrix. The largest eigenvalue of hypergraph
is the largest eigenvalue of its adjacency hipermatrix. The relationship between the
largest eigenvalue of adjacency matrix of graph and its chromatic number remain
fulfilled for the largest eigenvalue of adjacency hipermatrix of hypergraph and its
chromatic number. |
| format |
Theses |
| author |
Allan Juvito, Daniel |
| spellingShingle |
Allan Juvito, Daniel RELATION BETWEEN CHROMATIC NUMBER OF HYPERGRAPHS AND LARGEST EIGENVALUE OF HYPERMATRICES |
| author_facet |
Allan Juvito, Daniel |
| author_sort |
Allan Juvito, Daniel |
| title |
RELATION BETWEEN CHROMATIC NUMBER OF HYPERGRAPHS AND LARGEST EIGENVALUE OF HYPERMATRICES |
| title_short |
RELATION BETWEEN CHROMATIC NUMBER OF HYPERGRAPHS AND LARGEST EIGENVALUE OF HYPERMATRICES |
| title_full |
RELATION BETWEEN CHROMATIC NUMBER OF HYPERGRAPHS AND LARGEST EIGENVALUE OF HYPERMATRICES |
| title_fullStr |
RELATION BETWEEN CHROMATIC NUMBER OF HYPERGRAPHS AND LARGEST EIGENVALUE OF HYPERMATRICES |
| title_full_unstemmed |
RELATION BETWEEN CHROMATIC NUMBER OF HYPERGRAPHS AND LARGEST EIGENVALUE OF HYPERMATRICES |
| title_sort |
relation between chromatic number of hypergraphs and largest eigenvalue of hypermatrices |
| url |
https://digilib.itb.ac.id/gdl/view/44541 |
| _version_ |
1822926896621420544 |