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: | Bacoy, Jose B., Jr. |
---|---|
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 |
Similar Items
-
On the game chromatic number of Cartesian product of graphs
by: Encinas, Sarah Jane K., et al.
Published: (2010) -
On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graph
by: David, Monica Carlita G., et al.
Published: (2018) -
On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graphs
by: David, Monica Carlita G., et al.
Published: (2018) -
On the fold thickness of graphs
by: Campeña, Francis Joseph H., et al.
Published: (2020) -
On the fold thickness of bipartite doubles and other classes of graphs
by: Alcanites, Ma. Michelle B., et al.
Published: (2009)