The starlike trees which span a hypercube

DOI10.1016/0898-1221(88)90215-5zbMath0645.05032OpenAlexW2029685626MaRDI QIDQ1102977

Frank Harary, Martin Lewinter

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90215-5

zbMATH Keywords

hypercubeequitablestarlike treeconnected bipartite graph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Related Items (8)

A survey of the theory of hypercube graphs ⋮ Disjoint cycles in hypercubes with prescribed vertices in each cycle ⋮ On the equitable \(k^{*}\)-laceability of hypercubes ⋮ A spanning tree of the \(2^ m\)-dimensional hypercube with maximum number of degree-preserving vertices ⋮ Disjoint cycles and spanning graphs of hypercubes ⋮ A counter-example to a lemma about embedding starlike trees into hypercube ⋮ Graphs with all diametral paths through distant central nodes ⋮ Spanning subgraphs of a hypercube. IV: Rooted trees

Cites Work

• Parallel concepts in graph theory
• On quasistars in $n$-cubes
• One-legged caterpillars span hypercubes

This page was built for publication: The starlike trees which span a hypercube