On Rosa-type labelings and cyclic graph decompositions |
| |
Authors: | Saad I El-Zanati Charles Vanden Eynden |
| |
Institution: | (1) Department of Mathematics, Illinois State University, Normal, IL 61790-4520, USA |
| |
Abstract: | A labeling (or valuation) of a graph G is an assignment of integers to the vertices of G subject to certain conditions. A hierarchy of graph labelings was introduced by Rosa in the late 1960s. Rosa showed that
certain basic labelings of a graph G with n edges yielded cyclic G-decompositions of K
2n+1 while other stricter labelings yielded cyclic G-decompositions of K
2nx+1 for all natural numbers x. Rosa-type labelings are labelings with applications to cyclic graph decompositions. We survey various Rosa-type labelings
and summarize some of the related results.
(Communicated by Peter Horák) |
| |
Keywords: | graph labeling graph valuation Rosa-type labeling cyclic graph decomposition |
本文献已被 SpringerLink 等数据库收录! |