On the fold thickness of some classes of graphs

• Main Author: Campena, Francis Joseph H.
• Format: text
• Language: English
• Published: Animo Repository 2006
• Subjects: Graph theory; Graph algorithms; Graphic methods
• Online Access: https://animorepository.dlsu.edu.ph/etd_masteral/3376; https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10214/viewcontent/CDTG004051_P.pdf
• Institution: De La Salle University

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...