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: | Wannasit W., El-Zanati S. |
---|---|
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 |
Similar Items
-
On cyclic G-designs where G is a cubic tripartite graph
by: Wannasiri Wannasit, et al.
Published: (2018) -
On free α-labelings of cubic bipartite graphs
by: Wannasit W., et al.
Published: (2017) -
On free α-labelings of cubic bipartite graphs
by: Wannasiri Wannasit, et al.
Published: (2018) -
The spectrum problem for the cubic graphs of order 8
by: Peter Adams, et al.
Published: (2018) -
On σ -Tripartite Labelings of Odd Prisms and Even Möbius Ladders
by: Wannasiri Wannasit, et al.
Published: (2019)