α2-labeling of graphs

• Autorzy: Froncek D.
• Języki publikacji: EN

Abstrakty

EN

We show that if a graph G on n edges allows certain special type of rosy labeling (a.k.a. rho;-labeling), called α2-labeling, then for any positive integer k the complete graph K2nk+1 can be decomposed into copies of G. This notion generalizes the α-labeling introduced in 1967 by A. Rosa.

Słowa kluczowe

EN

graph decomposition; graph labeling

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2009
• Tom: Vol. 29, no. 4
• Strony: 393--397
• Opis fizyczny: Bibliogr. 5 poz.

Twórcy

autor

Froncek D.

• University of Minnesota Duluth Department of Mathematics and Statistics 1117 University Dr., Duluth, MN 55812, U.S.A.,

Bibliografia

• [1] S. El-Zanati, C. Vanden Eynden, N. Punnim, On the cyclic decomposition of complete graphs into bipartite graphs, Australas. J. Combin. 24 (2001), 209–219.
• [2] J.A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics DS6 (2007).
• [3] A. Lladó, G. Ringel, O. Serra, Decomposition of complete bipartite grafs into trees, DMAT Research Report, Univ. Politecnica de Catalunya, 11 (1996).
• [4] A. Lladó, S.C. López, Edge-decompositions of Kn,n into isomorphic copies of a given tree, J. Graph Theory 48 (2005).
• [5] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Intl. Symp. Rome 1966), Gordon and Breach, Dunod Paris, 1967, 349–355.