Folding the sum, cartesian product, composition and square of graphs
Every connected graph folds onto some complete graph which is not necessarily unique. It is known that if p is the chromatic number of a connected graph G then G folds onto Kp and to no other smaller complete graphs. On the other hand, the largest complete graph onto which a connected graph folds is...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2006
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/3427 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10265/viewcontent/CDTG004176_P__1_.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | Every connected graph folds onto some complete graph which is not necessarily unique. It is known that if p is the chromatic number of a connected graph G then G folds onto Kp and to no other smaller complete graphs. On the other hand, the largest complete graph onto which a connected graph folds is not known. We shall give here some results about the largest complete graph onto which a connected graph folds. In particular, we shall consider the sum, Cartesian product, and composition of graphs. |
|---|