Facebook Instagram Twitter RSS Feed PodBean Back to top on side

On Rosa-type labelings and cyclic graph decompositions

In: Mathematica Slovaca, vol. 59, no. 1
Saad I. El-Zanati - Charles Vanden Eynden
Detaily:
Rok, strany: 2009, 1 - 18
Kľúčové slová:
graph labeling, graph valuation, Rosa-type labeling, cyclic graph decomposition
DOI: https://doi.org/10.2478/s12175-008-0108-x
O článku:
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 $K2n+1$ while other stricter labelings yielded cyclic $G$-decompositions of $K2nx+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.
Ako citovať:
ISO 690:
El-Zanati, S., Eynden, C. 2009. On Rosa-type labelings and cyclic graph decompositions. In Mathematica Slovaca, vol. 59, no.1, pp. 1-18. 0139-9918. DOI: https://doi.org/10.2478/s12175-008-0108-x

APA:
El-Zanati, S., Eynden, C. (2009). On Rosa-type labelings and cyclic graph decompositions. Mathematica Slovaca, 59(1), 1-18. 0139-9918. DOI: https://doi.org/10.2478/s12175-008-0108-x
O vydaní: