On λ-fold Rosa-type Labelings of Bipartite Multigraphs

© 2017 Elsevier B.V. It is known that for a given (simple) graph G with n edges, there exits a cyclic G-decomposition of K 2n+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 K 2nx+1 f...

Full description

Saved in:
Bibliographic Details
Main Authors: Bunge R., El-Zanati S., Mudrock J., Vanden Eynden C., Wannasit W.
Format: Journal
Published: 2017
Online Access:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85021397534&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/40317
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Chiang Mai University
id th-cmuir.6653943832-40317
record_format dspace
spelling th-cmuir.6653943832-403172017-09-28T04:08:54Z On λ-fold Rosa-type Labelings of Bipartite Multigraphs Bunge R. El-Zanati S. Mudrock J. Vanden Eynden C. Wannasit W. © 2017 Elsevier B.V. It is known that for a given (simple) graph G with n edges, there exits a cyclic G-decomposition of K 2n+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 K 2nx+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. 2017-09-28T04:08:54Z 2017-09-28T04:08:54Z Journal 2-s2.0-85021397534 10.1016/j.endm.2017.06.003 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85021397534&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/40317
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
description © 2017 Elsevier B.V. It is known that for a given (simple) graph G with n edges, there exits a cyclic G-decomposition of K 2n+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 K 2nx+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.
format Journal
author Bunge R.
El-Zanati S.
Mudrock J.
Vanden Eynden C.
Wannasit W.
spellingShingle Bunge R.
El-Zanati S.
Mudrock J.
Vanden Eynden C.
Wannasit W.
On λ-fold Rosa-type Labelings of Bipartite Multigraphs
author_facet Bunge R.
El-Zanati S.
Mudrock J.
Vanden Eynden C.
Wannasit W.
author_sort Bunge R.
title On λ-fold Rosa-type Labelings of Bipartite Multigraphs
title_short On λ-fold Rosa-type Labelings of Bipartite Multigraphs
title_full On λ-fold Rosa-type Labelings of Bipartite Multigraphs
title_fullStr On λ-fold Rosa-type Labelings of Bipartite Multigraphs
title_full_unstemmed On λ-fold Rosa-type Labelings of Bipartite Multigraphs
title_sort on λ-fold rosa-type labelings of bipartite multigraphs
publishDate 2017
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85021397534&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/40317
_version_ 1681421787497234432