THE RAINBOW VERTEX CONNECTION NUMBER OF FINGER GRAPHS, MOUNTAIN GRAPHS, AND BOAT GRAPHS
All graphs considered in this thesis are simple and finite. Let G = (V (G),E(G)) be a nontrivial connected graph and k be a positive integer. Let c : V (G) → {1,2,...,k} be a k−coloring of the vertices of G. A path of G is said a rainbow vertex-path if whose internal ve...
Saved in:
Main Author: | P. (NIM : 20113060), JUNIATI |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/20232 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
RAINBOW CONNECTION NUMBER OF BULLET GRAPHS, SPECTRUM GRAPHS, AND GLOBE GRAPHS
by: , MELINA -
The Rainbow Connection Number of Some Graph Classes
by: SUKMA KUMALA, IRVANIA -
On planarity of the double vertex graphs of connected graphs
by: Cruz, Jose Avery S., et al.
Published: (2002) -
RAINBOW CONNECTIVITY OF GRAPHS WITH DIAMETER 2
by: MUHAMMAD HAIKAL B ROSMAN
Published: (2021) -
THE MINIMAL SIZE OF RAINBOW 3-CONNECTED GRAPH
by: SHULHANY (NIM: 20114053), AHMAD