SIMULATION OF RAINBOW VERTEX CONNECTION ON GRAPH OF THE CORONA PRODUCT OF TWO TREE GRAPHS
Graph ???? is a pair of sets (????,????) where ???? is a set of vertices and ???? is a set of edges. The corona product of two graphs ???? and ???? is defined as a graph obtained from duplicating graph ???? to each point of ???? and it is denoted by ?????????. A path ???? is said to be a rainbow ver...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/70888 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| id |
id-itb.:70888 |
|---|---|
| spelling |
id-itb.:708882023-01-24T15:07:45ZSIMULATION OF RAINBOW VERTEX CONNECTION ON GRAPH OF THE CORONA PRODUCT OF TWO TREE GRAPHS Eka Pranata, Widya Indonesia Theses tree graph, corona product, rainbow vertex connection, rainbow vertex connection algorithm INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/70888 Graph ???? is a pair of sets (????,????) where ???? is a set of vertices and ???? is a set of edges. The corona product of two graphs ???? and ???? is defined as a graph obtained from duplicating graph ???? to each point of ???? and it is denoted by ?????????. A path ???? is said to be a rainbow vertex path if the internal points in the path ???? are colored differently. The coloring of vertices on a graph ???? are said to be rainbow vertex connected if for every ???? and ???? in ????(????) there is a rainbow (vertex) path. Algorithms are logical steps to solve a systematically structured problem. This study constructed a rainbow vertex coloring algorithm on a tree graph and the corona product of two tree graphs. The algorithm is implemented into a programming language to determine the coloring of rainbow connected graphs of tree and the corona product of trees. 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 |
Graph ???? is a pair of sets (????,????) where ???? is a set of vertices and ???? is a set of edges. The corona product of two graphs ???? and ???? is defined as a graph obtained from duplicating graph ???? to each point of ???? and it is denoted by ?????????. A path ???? is said to be a rainbow vertex path if the internal points in the path ???? are colored differently. The coloring of vertices on a graph ???? are said to be rainbow vertex connected if for every ???? and ???? in ????(????) there is a rainbow (vertex) path.
Algorithms are logical steps to solve a systematically structured problem. This study constructed a rainbow vertex coloring algorithm on a tree graph and the corona product of two tree graphs. The algorithm is implemented into a programming language to determine the coloring of rainbow connected graphs of tree and the corona product of trees. |
| format |
Theses |
| author |
Eka Pranata, Widya |
| spellingShingle |
Eka Pranata, Widya SIMULATION OF RAINBOW VERTEX CONNECTION ON GRAPH OF THE CORONA PRODUCT OF TWO TREE GRAPHS |
| author_facet |
Eka Pranata, Widya |
| author_sort |
Eka Pranata, Widya |
| title |
SIMULATION OF RAINBOW VERTEX CONNECTION ON GRAPH OF THE CORONA PRODUCT OF TWO TREE GRAPHS |
| title_short |
SIMULATION OF RAINBOW VERTEX CONNECTION ON GRAPH OF THE CORONA PRODUCT OF TWO TREE GRAPHS |
| title_full |
SIMULATION OF RAINBOW VERTEX CONNECTION ON GRAPH OF THE CORONA PRODUCT OF TWO TREE GRAPHS |
| title_fullStr |
SIMULATION OF RAINBOW VERTEX CONNECTION ON GRAPH OF THE CORONA PRODUCT OF TWO TREE GRAPHS |
| title_full_unstemmed |
SIMULATION OF RAINBOW VERTEX CONNECTION ON GRAPH OF THE CORONA PRODUCT OF TWO TREE GRAPHS |
| title_sort |
simulation of rainbow vertex connection on graph of the corona product of two tree graphs |
| url |
https://digilib.itb.ac.id/gdl/view/70888 |
| _version_ |
1822006436654219264 |