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:
Main Author: | Campena, Francis Joseph H. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2006
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/3376 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10214/viewcontent/CDTG004051_P.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
On the fold thickness of graphs
by: Campeña, Francis Joseph H., et al.
Published: (2020) -
Fold thickness of some graphs
by: Campeña, Francis Joseph H., et al.
Published: (2009) -
On the fold thickness of bipartite doubles and other classes of graphs
by: Alcanites, Ma. Michelle B., et al.
Published: (2009) -
On the fold thickness of bipartite doubles and other classes of graphs
by: Alcanites, Ma. Michelle B., et al.
Published: (2009) -
A characterization theorem on graph folding
by: Gervacio, Severino V.
Published: (2002)