Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/71561Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Wannasiri Wannasit | en_US |
| dc.contributor.author | Saad El-Zanati | en_US |
| dc.date.accessioned | 2021-01-27T03:54:54Z | - |
| dc.date.available | 2021-01-27T03:54:54Z | - |
| dc.date.issued | 2020-01-01 | en_US |
| dc.identifier.issn | 03817032 | en_US |
| dc.identifier.other | 2-s2.0-85097296671 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85097296671&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/71561 | - |
| dc.description.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. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | On cyclic decompositions of the complete graph into the generalized Petersen graph | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Ars Combinatoria | en_US |
| article.volume | 148 | en_US |
| article.stream.affiliations | Illinois State University | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| 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.