Randomly twisted hypercubes
From MaRDI portal
Publication:1746591
DOI10.1016/j.ejc.2018.01.013zbMath1384.05140DBLPjournals/ejc/DudekPPQWZ18OpenAlexW2790277062WikidataQ57991408 ScholiaQ57991408MaRDI QIDQ1746591
Hao Qi, Xavier Pérez-Giménez, Paweł Prałat, Xuding Zhu, Douglas B. West, Andrzej Dudek
Publication date: 25 April 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2018.01.013
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Paths and cycles (05C38) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- The wide-diameter of \(Z_{n, k}\)
- A new variation on hypercubes with smaller diameter
- Wide diameter of Cartesian graph bundles
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- The vulnerability of the diameter of folded \(n\)-cubes
- Wide diameters of Cartesian product graphs and digraphs
- The vulnerability of the diameter of the enhanced hypercubes
- Mengerian properties, hamiltonicity, and claw‐free graphs
- A Hypercube Variant with Small Diameter
- The twisted N-cube with application to multiprocessing
This page was built for publication: Randomly twisted hypercubes