Burning Hamming graphs

DOI10.1007/S00373-024-02847-9MaRDI QIDQ6632150FDO

Authors Norihide Tokushige

Publication date 4 November 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Hamming distancebroadcast problem\(n\)-dimension cube

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distance in graphs (05C12)

Recommendations

• Burning number of graph products
• An upper bound on the burning number of graphs
• The burning number conjecture holds asymptotically
• The burning numbers of generalized Peterson graphs \(P(n, 1)\) and \(P(n, 2)\)
• Bounds on the burning number

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A survey of graph burning
• Balancing matrices with line shifts
• Introduction to Random Graphs
• Transmitting in the \(n\)-dimensional cube
• ``Integer-making theorems

This page was built for publication: Burning Hamming graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632150)