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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | 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 |