On the fold thickness of some classes of graph
Date of Publication
2006
Document Type
Master's Thesis
Degree Name
Master of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/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
Abstract Format
html
Language
English
Format
Electronic
Accession Number
CDTG005662
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
computer disc ; 4 3/4 in.
Recommended Citation
Campena, F. (2006). On the fold thickness of some classes of graph. Retrieved from https://animorepository.dlsu.edu.ph/etd_masteral/4659
- Usage
- Abstract Views: 15