RAINBOW CONNECTION NUMBER OF THE CEMARA GRAPH AND PIRAMID GRAPH
The concept of rainbow connection was introduced for the first time by Chartrand and friends on 2009. This concept appeared to minimize the number of password that be used to send the secure information between intelligence <br /> <br /> <br /> agencies in USA. Let G = (V (G); E(...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/24657 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | The concept of rainbow connection was introduced for the first time by Chartrand and friends on 2009. This concept appeared to minimize the number of password that be used to send the secure information between intelligence <br />
<br />
<br />
agencies in USA. Let G = (V (G); E(G)) be a nontrivial connected graph and m be a positive integer. Defined a m-coloring c : E(G) f1; 2; mg of the edges of G: A path P in G is called a rainbow path if no two edges of P are colored the same. Rainbow connection number of G denoted by rc(G) is the minimum m so that every pair of vertices in G is connected by at least one path in which no two edges of it are colored the same. In other words there <br />
<br />
<br />
exist rainbow u v path for every two vertices u and v in G. |
|---|