Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications

Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges

Grace Aspenson (University of Minnesota Duluth)
Dustin Baker (University of Minnesota Duluth)
Bryan Freyberg (University of Minnesota Duluth)
Coy Schwieder (University of Minnesota Duluth)

Article Info

Publish Date
08 Apr 2023

Abstract

Other than C9 there are 239 connected unicyclic graphs with exactly 9 edges. We use established graph labeling results to prove that every one of them decomposes the complete graph Kn if n ≡ 0 or 1 (mod 18).

Copyrights © 2023




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Electronic Journal of Graph Theory and Applications (EJGTA)
Website

Abbrev

ejgta

Publisher

Indonesian Combinatorial Society

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...