On Rosa-type labelings and cyclic graph decompositions

Mathematica Slovaca

Charles Eynden¹  Saad El-Zanati¹ 

关键词: graph labeling;    graph valuation;    Rosa-type labeling;    cyclic graph decomposition;   

DOI  :  10.2478/s12175-008-0108-x

学科分类：数学（综合）

来源: Slovenska Akademia Vied * Matematicky Ustav / Slovak Academy of Sciences, Mathematical Institute

【 摘 要 】

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.

【 授权许可】

Unknown