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:
主要作者: | |
---|---|
格式: | Theses |
語言: | Indonesia |
在線閱讀: | https://digilib.itb.ac.id/gdl/view/25738 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Institut Teknologi Bandung |
語言: | Indonesia |