Webs of Complete Graphs
Daniel Lewis
Fort Lewis College
Laura Scull
Fort Lewis College
Keywords: Graph Theory, x-homotopy
Abstract
Spider web graphs are a recent development related to the study of x-homotopy of graphs. This paper focuses on spider web graphs between complete graphs. We prove that these graphs are distance degree regular, and give a recursive formula for their distance degree sequences using techniques from group theory and combinatorics.
