On the fold thickness of graphs
The graph G′ obtained from a graph G by identifying two nonadjacent vertices in G having at least one common neighbor is called a 1-fold of G. A sequence G, G1, G2, … , Gk of graphs such that G= G and Gi is a 1-fold of Gi-1 for each i= 1 , 2 , … , k is called a uniform k-folding of G if the graphs i...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2020
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/3265 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |