Spanning Trees and Function Classes
Published in The Electronic Journal of Combinatorics • Aug 12, 2002
Authors:,
Jeffery B. Remmel
S. Gill Williamson
Abstract
If $G=K_n$ is the complete graph, the classical Prüffer correspondence gives a natural bijection between all spanning trees of $G$ (i.e., all Cayley trees) and all functions from a set of $n-2$ elements to a set of $n$ elements. If $G$ is a complete multipartite graph, then such bijections have been...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!