Spider Web Graphs
Keywords:
graph homomorphism; graph homotopy
Abstract
Recent results from Chih-Scull show that the ×-homotopy relation on finite graphs can be expressed via a sequence of “spider moves” which shift a single vertex at a time. In this paper we study a “spider web graph” which encodes exactly these spider moves between graph homomorphisms. We show how composition of graph homomorphisms relate to the spider web, study the components of spider webs for bipartite and tree graphs, and
finish by giving an explicit description of the spider web for homomorphisms from a bipartite graph to a star graph.
Published
2023-07-16
How to Cite
Hobbs, C., Martino, K., & Scull, L. (2023). Spider Web Graphs. The PUMP Journal of Undergraduate Research, 6, 250-267. Retrieved from https://journals.calstate.edu/pump/article/view/3332
Section
Articles
Copyright (c) 2023 Cinnamon Hobbs, Kai Martino, Laura Scull

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
The author(s) will retain the copyright, but by submitting the article agree to grant permission to the PUMP Journal of Undergraduate Research to publish, distribute, and archive the article. The author(s) will acknowledge prior publication in the PUMP Journal of Undergraduate Research for all future uses of the article or parts of it.