On free α-labelings of cubic bipartite graphs
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 th...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2017
|
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864831854&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42803 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-42803 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-428032017-09-28T06:39:36Z On free α-labelings of cubic bipartite graphs Wannasit W. El-Zanati S. 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. 2017-09-28T06:39:36Z 2017-09-28T06:39:36Z 2012-08-01 Journal 08353026 2-s2.0-84864831854 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864831854&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42803 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| description |
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. |
| format |
Journal |
| author |
Wannasit W. El-Zanati S. |
| spellingShingle |
Wannasit W. El-Zanati S. On free α-labelings of cubic bipartite graphs |
| author_facet |
Wannasit W. El-Zanati S. |
| author_sort |
Wannasit W. |
| title |
On free α-labelings of cubic bipartite graphs |
| title_short |
On free α-labelings of cubic bipartite graphs |
| title_full |
On free α-labelings of cubic bipartite graphs |
| title_fullStr |
On free α-labelings of cubic bipartite graphs |
| title_full_unstemmed |
On free α-labelings of cubic bipartite graphs |
| title_sort |
on free α-labelings of cubic bipartite graphs |
| publishDate |
2017 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84864831854&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42803 |
| _version_ |
1681422258810126336 |