Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
O'Neill Kingston
Iowa State University
Computer Science & IT Decision Sciences, Operations Research & Management

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Decomposition of complete graphs into connected unicyclic graphs with eight edges and pentagon Dalibor Froncek; O'Neill Kingston
Indonesian Journal of Combinatorics Vol 3, No 1 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (198.717 KB) | DOI: 10.19184/ijc.2019.3.1.3

Abstract

A G-decomposition of the complete graph Kn is a family of pairwise edge disjoint subgraphs of Kn, all isomorphic to G, such that every edge of Kn belongs to exactly one copy of G. Using standard decomposition techniques based on ρ-labelings, introduced by Rosa in 1967, and their modifications we show that each of the ten non-isomorphic connected unicyclic graphs with eight edges containing the pentagon decomposes the complete graph Kn whenever the necessary conditions are satisfied.
Co-Authors Dalibor Froncek