Minimum forts of the hypercube Q_d are open neighborhoods for every d not equal to 4, while Q_4 has exactly two automorphism classes of minimum forts.
Aazami , Hardness results and approximation algorithms for some problems on graphs, University of Waterloo, 2008
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On the forts and related parameters of the hypercube graph
Minimum forts of the hypercube Q_d are open neighborhoods for every d not equal to 4, while Q_4 has exactly two automorphism classes of minimum forts.