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...

Full description

Saved in:
Bibliographic Details
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
id oai:animorepository.dlsu.edu.ph:etd_masteral-10265
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_masteral-102652022-06-09T06:53:15Z Folding the sum, cartesian product, composition and square of graphs Bacoy, Jose B., Jr. 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. 2006-01-01T08:00:00Z text application/pdf https://animorepository.dlsu.edu.ph/etd_masteral/3427 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10265/viewcontent/CDTG004176_P__1_.pdf Master's Theses English Animo Repository Mathematics Graph theory Mathematics -- graph theory -- Cartesian product of graphs Mathematics
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 Mathematics
Graph theory
Mathematics -- graph theory -- Cartesian product of graphs
Mathematics
spellingShingle Mathematics
Graph theory
Mathematics -- graph theory -- Cartesian product of graphs
Mathematics
Bacoy, Jose B., Jr.
Folding the sum, cartesian product, composition and square of graphs
description 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.
format text
author Bacoy, Jose B., Jr.
author_facet Bacoy, Jose B., Jr.
author_sort Bacoy, Jose B., Jr.
title Folding the sum, cartesian product, composition and square of graphs
title_short Folding the sum, cartesian product, composition and square of graphs
title_full Folding the sum, cartesian product, composition and square of graphs
title_fullStr Folding the sum, cartesian product, composition and square of graphs
title_full_unstemmed Folding the sum, cartesian product, composition and square of graphs
title_sort folding the sum, cartesian product, composition and square of graphs
publisher Animo Repository
publishDate 2006
url https://animorepository.dlsu.edu.ph/etd_masteral/3427
https://animorepository.dlsu.edu.ph/context/etd_masteral/article/10265/viewcontent/CDTG004176_P__1_.pdf
_version_ 1778174572354338816