G-Designs for Tadpole Graphs
Authors
Published Date
Publisher
Abstract
We investigate the existence of G-designs for the tadpole family of graphs. Specifically, we show that for any tadpole graph G on n edges, G decomposes the complete graph on 2nk edges, and 2nk+1 edges, for any positive integer k. These tadpole graphs are classified into two cases: Those with an odd cycle, and those with an even cycle. For each case, graph labeling algorithms are defined for both rho-tripartite labelings and 1-rotational rho-tripartite labelings.
Description
Related to
item.page.replaces
License
Series/Report Number
Funding Information
University of Minnesota's Undergraduate Research Opportunities Program
item.page.isbn
DOI identifier
Previously Published Citation
Other identifiers
Suggested Citation
Jacobs, Cole. (2025). G-Designs for Tadpole Graphs. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/277441.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.