On the fold thickness of some classes of graphs
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:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
2006
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/3376 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10214/viewcontent/CDTG004051_P.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |
| 語言: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_masteral-10214 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_masteral-102142022-03-30T08:53:17Z On the fold thickness of some classes of graphs Campena, Francis Joseph H. 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. 2006-01-01T08:00:00Z text application/pdf https://animorepository.dlsu.edu.ph/etd_masteral/3376 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10214/viewcontent/CDTG004051_P.pdf Master's Theses English Animo Repository Graph theory Graph algorithms Graphic methods |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Graph theory Graph algorithms Graphic methods |
| spellingShingle |
Graph theory Graph algorithms Graphic methods Campena, Francis Joseph H. On the fold thickness of some classes of graphs |
| description |
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. |
| format |
text |
| author |
Campena, Francis Joseph H. |
| author_facet |
Campena, Francis Joseph H. |
| author_sort |
Campena, Francis Joseph H. |
| title |
On the fold thickness of some classes of graphs |
| title_short |
On the fold thickness of some classes of graphs |
| title_full |
On the fold thickness of some classes of graphs |
| title_fullStr |
On the fold thickness of some classes of graphs |
| title_full_unstemmed |
On the fold thickness of some classes of graphs |
| title_sort |
on the fold thickness of some classes of graphs |
| publisher |
Animo Repository |
| publishDate |
2006 |
| url |
https://animorepository.dlsu.edu.ph/etd_masteral/3376 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10214/viewcontent/CDTG004051_P.pdf |
| _version_ |
1775631132174319616 |