Decomposition of complete graphs into (0, 2)-prisms

Sylwia Cichacz; Soleh Dib; Dalibor Froncek

doi:10.1007/s10587-014-0080-2

Decomposition of complete graphs into (0, 2)-prisms

Sylwia Cichacz, Soleh Dib, Dalibor Froncek

Mathematics & Statistics

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

2 Scopus citations

Abstract

R. Frucht and J.Gallian (1988) proved that bipartite prisms of order 2n have an α-labeling, thus they decompose the complete graph K_6nx+1 for any positive integer x. We use a technique called the ρ{variant}⁺-labeling introduced by S. I. El-Zanati, C. Vanden Eynden, and N. Punnim (2001) to show that also some other families of 3-regular bipartite graphs of order 2n called generalized prisms decompose the complete graph K_6nx+1 for any positive integer x.

Original language	English (US)
Pages (from-to)	37-43
Number of pages	7
Journal	Czechoslovak Mathematical Journal
Volume	64
Issue number	1
DOIs	https://doi.org/10.1007/s10587-014-0080-2
State	Published - Mar 2014

Bibliographical note

Funding Information:
The author was supported by National Science Centre grant no. 2011/01/D/ST/04104.

Keywords

decompositions
prism

Publisher link

10.1007/s10587-014-0080-2

Find It

Find It at U of M Libraries

Cite this

@article{b1e1bf05a492402eb1dec9d3c9b799f8,

title = "Decomposition of complete graphs into (0, 2)-prisms",

abstract = "R. Frucht and J.Gallian (1988) proved that bipartite prisms of order 2n have an α-labeling, thus they decompose the complete graph K6nx+1 for any positive integer x. We use a technique called the ρ{variant}+-labeling introduced by S. I. El-Zanati, C. Vanden Eynden, and N. Punnim (2001) to show that also some other families of 3-regular bipartite graphs of order 2n called generalized prisms decompose the complete graph K6nx+1 for any positive integer x.",

keywords = "decompositions, prism",

author = "Sylwia Cichacz and Soleh Dib and Dalibor Froncek",

note = "Funding Information: The author was supported by National Science Centre grant no. 2011/01/D/ST/04104.",

year = "2014",

month = mar,

doi = "10.1007/s10587-014-0080-2",

language = "English (US)",

volume = "64",

pages = "37--43",

journal = "Czechoslovak Mathematical Journal",

issn = "0011-4642",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Decomposition of complete graphs into (0, 2)-prisms

AU - Cichacz, Sylwia

AU - Dib, Soleh

AU - Froncek, Dalibor

N1 - Funding Information: The author was supported by National Science Centre grant no. 2011/01/D/ST/04104.

PY - 2014/3

Y1 - 2014/3

N2 - R. Frucht and J.Gallian (1988) proved that bipartite prisms of order 2n have an α-labeling, thus they decompose the complete graph K6nx+1 for any positive integer x. We use a technique called the ρ{variant}+-labeling introduced by S. I. El-Zanati, C. Vanden Eynden, and N. Punnim (2001) to show that also some other families of 3-regular bipartite graphs of order 2n called generalized prisms decompose the complete graph K6nx+1 for any positive integer x.

AB - R. Frucht and J.Gallian (1988) proved that bipartite prisms of order 2n have an α-labeling, thus they decompose the complete graph K6nx+1 for any positive integer x. We use a technique called the ρ{variant}+-labeling introduced by S. I. El-Zanati, C. Vanden Eynden, and N. Punnim (2001) to show that also some other families of 3-regular bipartite graphs of order 2n called generalized prisms decompose the complete graph K6nx+1 for any positive integer x.

KW - decompositions

KW - prism

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

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

U2 - 10.1007/s10587-014-0080-2

DO - 10.1007/s10587-014-0080-2

M3 - Article

AN - SCOPUS:84906048721

SN - 0011-4642

VL - 64

SP - 37

EP - 43

JO - Czechoslovak Mathematical Journal

JF - Czechoslovak Mathematical Journal

IS - 1

ER -

Decomposition of complete graphs into (0, 2)-prisms

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this