Burning Hamming graphs

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

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)

Cites Work

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

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)