The b-chromatic number of power graphs of paths and cycles

Let G be a graph on the vertices n x , x ,..., x 1 2 . Its p-th power graph p G , has the same vertex set as G, with two distinct vertices of G adjacent in p G whenever there is a path of length at most p between them in G. The b-chromatic number of G, denoted by ϕ(G), is defined as the maximum numb...

全面介紹

Saved in:
書目詳細資料
主要作者: San Diego, Immanuel T.
格式: text
語言:English
出版: Animo Repository 2005
主題:
在線閱讀:https://animorepository.dlsu.edu.ph/etd_masteral/5892
https://animorepository.dlsu.edu.ph/context/etd_masteral/article/12714/viewcontent/CDTG003897_F_Partial.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: De La Salle University
語言: English