Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/51795Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Wannasiri Wannasit | en_US |
| dc.contributor.author | Saad El-Zanati | en_US |
| dc.date.accessioned | 2018-09-04T06:09:12Z | - |
| dc.date.available | 2018-09-04T06:09:12Z | - |
| dc.date.issued | 2012-08-01 | en_US |
| dc.identifier.issn | 08353026 | en_US |
| dc.identifier.other | 2-s2.0-84864831854 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864831854&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/51795 | - |
| dc.description.abstract | It is known that an a-labeling of a bipartite graph G with n edges can be used to obtain a cyclic G-decomposition of K 2nx+1 for every positive integer x. It is also known that if two graphs G and H admit a free a-labeling, then their vertex-disjoint union also admits a free a-labeling. We show that if G is a bipartite prism, a bipartite Möbius ladder or a connected cubic bipartite graph of order at most 14, then G admits a free a-labeling. We conjecture that every bipartite cubic graph admits a free a-labeling. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | On free α-labelings of cubic bipartite graphs | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Journal of Combinatorial Mathematics and Combinatorial Computing | en_US |
| article.volume | 82 | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| article.stream.affiliations | Illinois State 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.