2-diameter of de Bruijn graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199608)28:1<7::AID-NET2>3.0.CO;2-J" /><7::AID-NET2>3.0.CO;2-J 10.1002/(SICI)1097-0037(199608)28:1<7::AID-NET2>3.0.CO;2-JzbMath0865.90056OpenAlexW2136901208MaRDI QIDQ5689813

Qiao Li, Dominique Sotteau, Jun-Ming Xu

Publication date: 7 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199608)28:1<7::aid-net2>3.0.co;2-j

zbMATH Keywords

undirected binary de Bruijn graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Related Items (7)

Restricted fault diameter of hypercube networks ⋮ Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs ⋮ On \(k\)-diameter of \(k\)-connected graphs ⋮ Short containers in Cayley graphs ⋮ On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs ⋮ On the total\(_k\)-diameter of connection networks ⋮ \((d,m)\)-dominating numbers of hypercube

This page was built for publication: 2-diameter of de Bruijn graphs