Decomposition of complete graphs into tri-cyclic graphs with eight edges

Dalibor Froncek; Bethany Kubik

Decomposition of complete graphs into tri-cyclic graphs with eight edges

Dalibor Froncek, Bethany Kubik

Mathematics & Statistics

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

2 Scopus citations

Abstract

In this paper, we use standard graph labeling techniques to prove that each tri-cyclic graph with eight edges decomposes the complete graph K_nif and only if n = 0,1 (mod 16). We apply ^-tripartite labelings and 1-rotational p-tripartite labelings.

Original language	English (US)
Pages (from-to)	143-165
Number of pages	23
Journal	Journal of Combinatorial Mathematics and Combinatorial Computing
Volume	114
State	Published - Aug 2020

Bibliographical note

Publisher Copyright:
© 2020 Charles Babbage Research Centre. All rights reserved.

Keywords

G-design
Graph decomposition
P-labeling

Find It

Find It at U of M Libraries

Cite this

@article{57e2892f74974f609971455337e05e03,

title = "Decomposition of complete graphs into tri-cyclic graphs with eight edges",

abstract = "In this paper, we use standard graph labeling techniques to prove that each tri-cyclic graph with eight edges decomposes the complete graph Knif and only if n = 0,1 (mod 16). We apply ^-tripartite labelings and 1-rotational p-tripartite labelings.",

keywords = "G-design, Graph decomposition, P-labeling",

author = "Dalibor Froncek and Bethany Kubik",

year = "2020",

month = aug,

language = "English (US)",

volume = "114",

pages = "143--165",

journal = "Journal of Combinatorial Mathematics and Combinatorial Computing",

issn = "0835-3026",

publisher = "Charles Babbage Research Centre",

}

TY - JOUR

T1 - Decomposition of complete graphs into tri-cyclic graphs with eight edges

AU - Froncek, Dalibor

AU - Kubik, Bethany

PY - 2020/8

Y1 - 2020/8

N2 - In this paper, we use standard graph labeling techniques to prove that each tri-cyclic graph with eight edges decomposes the complete graph Knif and only if n = 0,1 (mod 16). We apply ^-tripartite labelings and 1-rotational p-tripartite labelings.

AB - In this paper, we use standard graph labeling techniques to prove that each tri-cyclic graph with eight edges decomposes the complete graph Knif and only if n = 0,1 (mod 16). We apply ^-tripartite labelings and 1-rotational p-tripartite labelings.

KW - G-design

KW - Graph decomposition

KW - P-labeling

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

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

M3 - Article

AN - SCOPUS:85108724048

SN - 0835-3026

VL - 114

SP - 143

EP - 165

JO - Journal of Combinatorial Mathematics and Combinatorial Computing

JF - Journal of Combinatorial Mathematics and Combinatorial Computing

ER -

Decomposition of complete graphs into tri-cyclic graphs with eight edges

Abstract

Bibliographical note

Keywords

Find It

Other files and links

Fingerprint

Cite this