Randomly twisted hypercubes
DOI10.1016/J.EJC.2018.01.013zbMATH Open1384.05140DBLPjournals/ejc/DudekPPQWZ18OpenAlexW2790277062WikidataQ57991408 ScholiaQ57991408MaRDI QIDQ1746591FDOQ1746591
Authors: Andrzej Dudek, Xavier Pérez-Giménez, Paweł Prałat, Hao Qi, Douglas B. West, Xuding Zhu
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
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Paths and cycles (05C38) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- The twisted N-cube with application to multiprocessing
- Title not available (Why is that?)
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- Mengerian properties, hamiltonicity, and claw‐free graphs
- The wide-diameter of \(Z_{n, k}\)
- A new variation on hypercubes with smaller diameter
- Wide diameters of Cartesian product graphs and digraphs
- The vulnerability of the diameter of folded \(n\)-cubes
- Wide diameter of Cartesian graph bundles
- A hypercube variant with small diameter
- The vulnerability of the diameter of the enhanced hypercubes
Cited In (3)
This page was built for publication: Randomly twisted hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746591)