A spanning tree of the 2m-dimensional hypercube with maximum number of degree-preserving vertices

Abstract

Choi, S. and P. Guan, A spanning tree of the 2”-dimensional hypercube with maximum number of degree-preserving vertices, Discrete Mathematics 117 (1993) 2755277. For an n-dimensional hypercube Q., the maximum number of degree-preserving vertices in a spanning tree is 2”jn if n = 2” for an integer M. (If n # 2”, then the maximum number of degree-preserving… (More)
DOI: 10.1016/0012-365X(93)90343-R

Topics

  • Presentations referencing similar topics