Spanning Trees and Domination in Hypercubes

zbMath1493.05229arXiv1905.13292MaRDI QIDQ3390433

Jerrold R. Griggs

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/1905.13292

zbMATH Keywords

hypercubespanning treeconnected domination number

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Constructing full spanning trees for cubic graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Unit sphere packings and coverings of the Hamming space
• On independent and \((d, n)\)-domination numbers of hypercubes
• Spanning trees with many leaves in cubic graphs
• Spanning Trees with Many Leaves
• Connected Domination and Spanning Trees with Many Leaves
• Leafy spanning trees in hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning Trees and Domination in Hypercubes