Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges

John Fahnenstiel; Dalibor Froncek

doi:10.5614/ejgta.2019.7.2.4

Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges

John Fahnenstiel, Dalibor Froncek

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.

Original language	English (US)
Pages (from-to)	235-250
Number of pages	16
Journal	Electronic Journal of Graph Theory and Applications
Volume	7
Issue number	2
DOIs	https://doi.org/10.5614/ejgta.2019.7.2.4
State	Published - 2019

Keywords

Graph decomposition
Rosa type labeling
α-labeling
α-labeling

Publisher link

10.5614/ejgta.2019.7.2.4

Find It

Find It at U of M Libraries

Cite this

@article{46d73ec286d84e27ad65db0691d11f45,

title = "Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges",

abstract = "We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.",

keywords = "Graph decomposition, Rosa type labeling, α-labeling, α-labeling",

author = "John Fahnenstiel and Dalibor Froncek",

year = "2019",

doi = "10.5614/ejgta.2019.7.2.4",

language = "English (US)",

volume = "7",

pages = "235--250",

journal = "Electronic Journal of Graph Theory and Applications",

issn = "2338-2287",

publisher = "Indonesian Combinatorics Society",

number = "2",

}

TY - JOUR

T1 - Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges

AU - Fahnenstiel, John

AU - Froncek, Dalibor

PY - 2019

Y1 - 2019

N2 - We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.

AB - We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.

KW - Graph decomposition

KW - Rosa type labeling

KW - α-labeling

UR - http://www.scopus.com/inward/record.url?scp=85074712388&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85074712388&partnerID=8YFLogxK

U2 - 10.5614/ejgta.2019.7.2.4

DO - 10.5614/ejgta.2019.7.2.4

M3 - Article

AN - SCOPUS:85074712388

SN - 2338-2287

VL - 7

SP - 235

EP - 250

JO - Electronic Journal of Graph Theory and Applications

JF - Electronic Journal of Graph Theory and Applications

IS - 2

ER -

Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges

Abstract

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this