Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees

Michael Kubesa

Discussiones Mathematicae Graph Theory (2005)

  • Volume: 25, Issue: 3, page 311-324
  • ISSN: 2083-5892

Abstract

top
We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, which allow factorization of K 2 n into spanning trees, arising from the trees with α-labelings.

How to cite

top

Michael Kubesa. "Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees." Discussiones Mathematicae Graph Theory 25.3 (2005): 311-324. <http://eudml.org/doc/270279>.

@article{MichaelKubesa2005,
abstract = {We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, which allow factorization of $K_\{2n\}$ into spanning trees, arising from the trees with α-labelings.},
author = {Michael Kubesa},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {graph decomposition and factorization; graph labeling; α-labeling; flexible q-labeling; α-like labeling; -labeling; -like labeling; flexible -labeling},
language = {eng},
number = {3},
pages = {311-324},
title = {Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees},
url = {http://eudml.org/doc/270279},
volume = {25},
year = {2005},
}

TY - JOUR
AU - Michael Kubesa
TI - Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees
JO - Discussiones Mathematicae Graph Theory
PY - 2005
VL - 25
IS - 3
SP - 311
EP - 324
AB - We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, which allow factorization of $K_{2n}$ into spanning trees, arising from the trees with α-labelings.
LA - eng
KW - graph decomposition and factorization; graph labeling; α-labeling; flexible q-labeling; α-like labeling; -labeling; -like labeling; flexible -labeling
UR - http://eudml.org/doc/270279
ER -

References

top
  1. [1] P. Eldergill, Decompositions of the complete graph with an even number of vertices (M.Sc. thesis, McMaster University, Hamilton, 1997). 
  2. [2] D. Froncek, Cyclic decompositions of complete graphs into spanning trees, Discuss. Math. Graph Theory 24 (2004) 345-352, doi: 10.7151/dmgt.1235. Zbl1060.05080
  3. [3] D. Froncek, Bi-cyclic decompositions of complete graphs into spanning trees, submitted for publication. Zbl1118.05079
  4. [4] D. Froncek and M. Kubesa, Factorizations of complete graphs into spanning trees, Congress. Numer. 154 (2002) 125-134. Zbl1021.05083
  5. [5] A. Rosa, Cyclic decompositions of complete graphs (Ph.D. thesis, Slovak Academy of Science, Bratislava, 1965). 
  6. [6] A. Rosa, On certain valuations of the vertices of a graph, in: Theory of Graphs, Intl. Symp. Rome 1966 (Gordon and Breach, Dunod, Paris, 1967) 349-355. 
  7. [7] M. Kubesa, Spanning tree factorizations of complete graphs, J. Combin. Math. and Combin. Computing, accepted for publication. Zbl1067.05059

NotesEmbed ?

top

You must be logged in to post comments.