UNICYCLIC GRAPH OF ORDER 𝐍 WITH CERTAIN LOCATING-CHROMATIC NUMBER

Let G=(V,E) be a connected graph. Let &#928;={L_1,L_2,…,L_k } be an ordered partition of V(G) into the resulting color classes L_i (1&#8804;i&#8804;k) induced by a coloring c of k colors. The color code c_&#928; (v) of a vertex v in G is defined as <br /> <br /> c_&am...

全面介紹

Saved in:
書目詳細資料
主要作者: - NIM: 90116003 , ARFIN
格式: Theses
語言:Indonesia
在線閱讀:https://digilib.itb.ac.id/gdl/view/25738
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Institut Teknologi Bandung
語言: Indonesia