Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

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

Sylwia CichaczSoleh DibDalibor Fronček — 2014

Czechoslovak Mathematical Journal

R. Frucht and J. Gallian (1988) proved that bipartite prisms of order 2 n have an α -labeling, thus they decompose the complete graph K 6 n x + 1 for any positive integer x . We use a technique called the ρ + -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 2 n called generalized prisms decompose the complete graph K 6 n x + 1 for any positive integer x .

Page 1

Download Results (CSV)