On the fold thickness of graphs

• المؤلفون الرئيسيون: Campeña, Francis Joseph H., Gervacio, Severino V.
• التنسيق: text
• منشور في: Animo Repository 2020
• الموضوعات: Bipartite graphs; Graph theory; Mathematics
• الوصول للمادة أونلاين: https://animorepository.dlsu.edu.ph/faculty_research/3265

The graph G′ obtained from a graph G by identifying two nonadjacent vertices in G having at least one common neighbor is called a 1-fold of G. A sequence G, G1, G2, … , Gk of graphs such that G= G and Gi is a 1-fold of Gi-1 for each i= 1 , 2 , … , k is called a uniform k-folding of G if the graphs i...