On the fold thickness of some classes of graphs

• 主要作者: Campena, Francis Joseph H.
• 格式: text
• 語言: English
• 出版: Animo Repository 2006
• 主題: Graph theory; Graph algorithms; Graphic methods
• 在線閱讀: https://animorepository.dlsu.edu.ph/etd_masteral/3376; https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10214/viewcontent/CDTG004051_P.pdf

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