On the fold thickness of some classes of graphs
A graph G0 obtained from G by identifying two non-adjacent vertices in G having a common neighbor is called a 1-fold of G. A sequence G0,G1,G2, . . . ,Gk of graphs such that G0 = G and Gi is a 1-fold of Gi1 for i = 1, 2, 3, . . . , k is a uniform k-folding of G if all the graphs in the sequence are...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | text |
| اللغة: | English |
| منشور في: |
Animo Repository
2006
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://animorepository.dlsu.edu.ph/etd_masteral/3376 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10214/viewcontent/CDTG004051_P.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|