Start Date
April 2024
Location
CLC 207
Abstract
A circulant graph, Cn(a1,a2,…,ak), is a graph of n vertices in which the vertices are laid out circularly, and a1, a2,…, ak are the edge lengths. In this research, we focused on studying the cycle structures within Cn(a1,a2,…,ak). Our goal was to find all of the cycles and their types in Cn(a1,a2,…,ak). In this talk, we highlight our findings, as well as the methods used to obtain said findings.
Triangles in Circulant Graphs
CLC 207
A circulant graph, Cn(a1,a2,…,ak), is a graph of n vertices in which the vertices are laid out circularly, and a1, a2,…, ak are the edge lengths. In this research, we focused on studying the cycle structures within Cn(a1,a2,…,ak). Our goal was to find all of the cycles and their types in Cn(a1,a2,…,ak). In this talk, we highlight our findings, as well as the methods used to obtain said findings.
