Wide diameter of Cartesian graph bundles
From MaRDI portal
Publication:973142
DOI10.1016/J.DISC.2009.11.024zbMATH Open1222.05221OpenAlexW2060704389MaRDI QIDQ973142FDOQ973142
Authors: Iztok Banič, Janez Žerovnik 
Publication date: 28 May 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.024
Recommendations
Cites Work
- Title not available (Why is that?)
- Edge-colorability of graph bundles
- Algorithm for recognizing Cartesian graph bundles
- Fault-diameter of Cartesian graph bundles
- Multiplicative circulant networks. Topological properties and communication algorithms
- On generalized twisted cubes
- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- Mengerian properties, hamiltonicity, and claw‐free graphs
Cited In (12)
- Plenary Lecture 3: Fault diameters of graph products and bundles
- Mixed fault diameter of Cartesian graph bundles
- Wide-diameter of product graphs
- Graph bundles and Ricci‐flatness
- Mixed fault diameter of Cartesian graph bundles. II.
- Randomly twisted hypercubes
- Topological properties on the diameters of the integer simplex
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
- The edge fault-diameter of Cartesian graph bundles
- Wide diameter for two families of interconnection networks
- On strong graph bundles
- Wide diameters of Cartesian product graphs and digraphs
This page was built for publication: Wide diameter of Cartesian graph bundles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973142)
