Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/71561
Title: On cyclic decompositions of the complete graph into the generalized Petersen graph
Authors: Wannasiri Wannasit
Saad El-Zanati
Authors: Wannasiri Wannasit
Saad El-Zanati
Keywords: Mathematics
Issue Date: 1-Jan-2020
Abstract: © 2020 Charles Babbage Research Centre. All rights reserved. It is known that a uniformly-ordered p-labeling (also known as a p++-labeling) of a bipartite graph G with m edges can be used to obtain a cyclic G-decompoeition of Kimt+i for every positive integer t. We show that the generalized Petersen graph P(6r, 3) admits a p++-labeling for every integer r > 2.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85097296671&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/71561
ISSN: 03817032
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.