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

Title:

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

Creator:

Cichacz, Sylwia, Dib, Soleh, and Froncek, Dalibor

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:47f7856a-08ed-444c-85fb-0edb8682bc14
uuid:47f7856a-08ed-444c-85fb-0edb8682bc14

Subject:

decompositions, prism, and $\rho ^+$-labeling

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

R. Frucht and J. Gallian (1988) proved that bipartite prisms of order $2n$ have an $\alpha $-labeling, thus they decompose the complete graph $K_{6nx+1}$ for any positive integer $x$. We use a technique called the $\rho ^{+}$-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$.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

37-43

Source:

Czechoslovak Mathematical Journal | 2014 Volume:64 | Number:1

Harvested from:

CDK

Metadata only:

false