On σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders
© 2017, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia. A common question in the study of graph decompositions is when does a graph G decompose the complete graph or the complete graph with a 1-factor removed or added. It is known that a σ-tripartite labeling of a tr...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85064050252&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65683 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-65683 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-656832019-08-05T04:39:24Z On σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders Wannasiri Wannasit Saad El-Zanati Mathematics © 2017, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia. A common question in the study of graph decompositions is when does a graph G decompose the complete graph or the complete graph with a 1-factor removed or added. 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. Moreover, it can be used to obtain a cyclic G-decomposition of both K 2nt+2 - I and K 2nt + I, where I is a 1-factor. We show that if G is an odd prism on 10 or more vertices or an even Möbius ladder, then G admits a σ-tripartite labeling. 2019-08-05T04:39:24Z 2019-08-05T04:39:24Z 2019-03-15 Journal 21804206 01266705 2-s2.0-85064050252 10.1007/s40840-017-0503-y https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85064050252&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65683 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Mathematics |
| spellingShingle |
Mathematics Wannasiri Wannasit Saad El-Zanati On σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders |
| description |
© 2017, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia. A common question in the study of graph decompositions is when does a graph G decompose the complete graph or the complete graph with a 1-factor removed or added. 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. Moreover, it can be used to obtain a cyclic G-decomposition of both K 2nt+2 - I and K 2nt + I, where I is a 1-factor. We show that if G is an odd prism on 10 or more vertices or an even Möbius ladder, then G admits a σ-tripartite labeling. |
| format |
Journal |
| author |
Wannasiri Wannasit Saad El-Zanati |
| author_facet |
Wannasiri Wannasit Saad El-Zanati |
| author_sort |
Wannasiri Wannasit |
| title |
On σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders |
| title_short |
On σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders |
| title_full |
On σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders |
| title_fullStr |
On σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders |
| title_full_unstemmed |
On σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders |
| title_sort |
on σ -tripartite labelings of odd prisms and even möbius ladders |
| publishDate |
2019 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85064050252&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65683 |
| _version_ |
1681426314598285312 |