Decomposition of complete graphs into small generalized prisms

Sylwia Cichacz; Dalibor Froncek; Mariusz Meszka

Decomposition of complete graphs into small generalized prisms

Sylwia Cichacz
, Dalibor Froncek
, Mariusz Meszka

Mathematics & Statistics

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

Abstract

A prism is the Cartesian product C_m{square subset}P₂. In other words, it is a graph consisting of two cycles of the same length whose corresponding vertices are joined by additional edges forming a matching. The problem of decomposition of complete graphs into prisms with 12 or 16 vertices was completely solved in [12]. In this paper we completely characterize the complete graphs that are decomposable into 3-regular bipartite graphs of order 12 or 16 that are a simple modification of prisms.

Original language	English (US)
Pages (from-to)	285-293
Number of pages	9
Journal	AKCE International Journal of Graphs and Combinatorics
Volume	10
Issue number	3
State	Published - Oct 1 2013

Keywords

3-regular bipartite graph
Graceful labeling
Graph decomposition
Prism
α-labeling

Find It

Find It at U of M Libraries

Cite this

@article{fbffc20f72e9481d95dde1a3930bc0a2,

title = "Decomposition of complete graphs into small generalized prisms",

abstract = "A prism is the Cartesian product Cm\{square subset\}P2. In other words, it is a graph consisting of two cycles of the same length whose corresponding vertices are joined by additional edges forming a matching. The problem of decomposition of complete graphs into prisms with 12 or 16 vertices was completely solved in [12]. In this paper we completely characterize the complete graphs that are decomposable into 3-regular bipartite graphs of order 12 or 16 that are a simple modification of prisms.",

keywords = "3-regular bipartite graph, Graceful labeling, Graph decomposition, Prism, α-labeling",

author = "Sylwia Cichacz and Dalibor Froncek and Mariusz Meszka",

year = "2013",

month = oct,

day = "1",

language = "English (US)",

volume = "10",

pages = "285--293",

journal = "AKCE International Journal of Graphs and Combinatorics",

issn = "0972-8600",

publisher = "Taylor and Francis Ltd.",

number = "3",

}

TY - JOUR

T1 - Decomposition of complete graphs into small generalized prisms

AU - Cichacz, Sylwia

AU - Froncek, Dalibor

AU - Meszka, Mariusz

PY - 2013/10/1

Y1 - 2013/10/1

N2 - A prism is the Cartesian product Cm{square subset}P2. In other words, it is a graph consisting of two cycles of the same length whose corresponding vertices are joined by additional edges forming a matching. The problem of decomposition of complete graphs into prisms with 12 or 16 vertices was completely solved in [12]. In this paper we completely characterize the complete graphs that are decomposable into 3-regular bipartite graphs of order 12 or 16 that are a simple modification of prisms.

AB - A prism is the Cartesian product Cm{square subset}P2. In other words, it is a graph consisting of two cycles of the same length whose corresponding vertices are joined by additional edges forming a matching. The problem of decomposition of complete graphs into prisms with 12 or 16 vertices was completely solved in [12]. In this paper we completely characterize the complete graphs that are decomposable into 3-regular bipartite graphs of order 12 or 16 that are a simple modification of prisms.

KW - 3-regular bipartite graph

KW - Graceful labeling

KW - Graph decomposition

KW - Prism

KW - α-labeling

UR - https://www.scopus.com/pages/publications/84885163852

UR - https://www.scopus.com/pages/publications/84885163852#tab=citedBy

M3 - Article

AN - SCOPUS:84885163852

SN - 0972-8600

VL - 10

SP - 285

EP - 293

JO - AKCE International Journal of Graphs and Combinatorics

JF - AKCE International Journal of Graphs and Combinatorics

IS - 3

ER -

Decomposition of complete graphs into small generalized prisms

Abstract

Keywords

Find It

Other files and links

Fingerprint

Cite this