On cyclic G-designs where G is a cubic tripartite graph
It is known that a ρ-tripartite labeling of a tripartite graph G with n edges can be used to obtain a cyclic G-decomposition of K 2nt+1 for every positive integer t. We show that if G is an odd prism, an even Möbius ladder or a connected cubic tripartite graph of order at most 10, then G admits a ρ...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2017
|
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=80955172797&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42897 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-42897 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-428972017-09-28T06:42:06Z On cyclic G-designs where G is a cubic tripartite graph Wannasit W. El-Zanati S. It is known that a ρ-tripartite labeling of a tripartite graph G with n edges can be used to obtain a cyclic G-decomposition of K 2nt+1 for every positive integer t. We show that if G is an odd prism, an even Möbius ladder or a connected cubic tripartite graph of order at most 10, then G admits a ρ-tripartite labeling. We conjecture that every connected tripartite cubic graph admits a ρ-tripartite labeling. © 2011 Elsevier B.V. All rights reserved. 2017-09-28T06:42:06Z 2017-09-28T06:42:06Z 2012-01-28 Journal 0012365X 2-s2.0-80955172797 10.1016/j.disc.2011.09.017 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=80955172797&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42897 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| description |
It is known that a ρ-tripartite labeling of a tripartite graph G with n edges can be used to obtain a cyclic G-decomposition of K 2nt+1 for every positive integer t. We show that if G is an odd prism, an even Möbius ladder or a connected cubic tripartite graph of order at most 10, then G admits a ρ-tripartite labeling. We conjecture that every connected tripartite cubic graph admits a ρ-tripartite labeling. © 2011 Elsevier B.V. All rights reserved. |
| format |
Journal |
| author |
Wannasit W. El-Zanati S. |
| spellingShingle |
Wannasit W. El-Zanati S. On cyclic G-designs where G is a cubic tripartite graph |
| author_facet |
Wannasit W. El-Zanati S. |
| author_sort |
Wannasit W. |
| title |
On cyclic G-designs where G is a cubic tripartite graph |
| title_short |
On cyclic G-designs where G is a cubic tripartite graph |
| title_full |
On cyclic G-designs where G is a cubic tripartite graph |
| title_fullStr |
On cyclic G-designs where G is a cubic tripartite graph |
| title_full_unstemmed |
On cyclic G-designs where G is a cubic tripartite graph |
| title_sort |
on cyclic g-designs where g is a cubic tripartite graph |
| publishDate |
2017 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=80955172797&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/42897 |
| _version_ |
1681422276612849664 |