On the fold thickness of some classes of graph
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2006
|
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/4659 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | 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 singular or all are non-singular. The fold thickness of a graph G is the largest integer k for which there is a uniform k-folding of G. It is known that the fold thickness of a bipartite graph of order n is n 3 if it is singular and 0 otherwise. We will show here formulas for the fold thickness of the cartesian product of some graphs as well as the fold thickness of p copies of a bipartite graph G, and other types of graphs |
|---|