UNICYCLIC GRAPH OF ORDER 𝐍 WITH CERTAIN LOCATING-CHROMATIC NUMBER
Let G=(V,E) be a connected graph. Let Π={L_1,L_2,…,L_k } be an ordered partition of V(G) into the resulting color classes L_i (1≤i≤k) induced by a coloring c of k colors. The color code c_Π (v) of a vertex v in G is defined as <br /> <br /> c_&am...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/25738 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |