Spanning subgraphs of a hypercube. IV: Rooted trees

DOI10.1016/0895-7177(93)90258-ZzbMath0791.05020OpenAlexW2059164288MaRDI QIDQ1310235

Frank Harary, Martin Lewinter

Publication date: 28 June 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(93)90258-z

zbMATH Keywords

hypercubeboundsspanning treerooted tree

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Regular Connected Bipancyclic Spanning Subgraphs of Torus Networks ⋮ Hyper-Hamilton laceable and caterpillar-spannable product graphs ⋮ Regular connected bipancyclic spanning subgraphs of hypercubes ⋮ On zero-sum spanning trees and zero-sum connectivity

Cites Work

• The starlike trees which span a hypercube
• Interpolation theorem for diameters of spanning trees
• On quasistars in $n$-cubes
• One-legged caterpillars span hypercubes
• Interpolation theorem for the number of end‐vertices of spanning trees

This page was built for publication: Spanning subgraphs of a hypercube. IV: Rooted trees