2-diameter of de Bruijn graphs

DOI10.1002/(SICI)1097-0037(199608)28:1%3C7::AID-NET2%3E3.0.CO;2-JMaRDI QIDQ5689813zbMATH OpenOpenAlexFDO

Authors Qiao Li, D. 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%3C7::aid-net2%3E3.0.co;2-j

zbMATH Keywords

undirected binary de Bruijn graph

Mathematics Subject Classification ID

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

Recommendations

• A new property of binary undirected de Bruijn graphs
• Wide diameters of de Bruijn graphs
• On the diameter of the generalized undirected de Bruijn graphsUG_B(n,m),n²<m≤n³
• On the diameter of the generalized undirected de Bruijn graphs.

Cited in

(11)

• 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
• Restricted fault diameter of hypercube networks
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
• Wide diameters of de Bruijn graphs
• On the diameter of the generalized undirected de Bruijn graphsUG_B(n,m),n²<m≤n³
• scientific article; zbMATH DE number 2075779 (Why is no real title available?)
• On \(k\)-diameter of \(k\)-connected graphs
• Quasi-centers and radius related to some iterated line digraphs, proofs of several conjectures on de Bruijn and Kautz graphs

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

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