Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777151 | Electronic Notes in Discrete Mathematics | 2017 | 13 Pages |
Abstract
It is known that for a given (simple) graph G with n edges, there exits a cyclic G-decomposition of K2n+1 if and only if G admits a Ï-labeling. It is also known that if G is bipartite and it admits an ordered Ï-labeling, then there exists a cyclic G-decomposition of K2nx+1 for every positive integer x. We extend these concepts to labelings of multigraphs through what we call λ-fold Ï-labelings and ordered λ-fold Ï-labelings. Let Kmλ denote the λ-fold complete graph of order m. We sho that if a subgraph G of K2n/λ+1λ has size n, there exits a cyclic G-decomposition of K2n/λ+1λ if and only if G admits a λ-fold Ï-labeling. If in addition G is bipartite and it admits an ordered λ-fold Ï-labeling, then there exists a cyclic G-decomposition of K2nx/λ+1λ for every positive integer x. We discuss some classes of graphs and multigraphs that admit such labelings.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
R.C. Bunge, S.I. El-Zanati, J. Mudrock, C. Vanden Eynden, W. Wannasit,