Mixed fault diameter of Cartesian graph bundles. II.
From MaRDI portal
Distance in graphs (05C12) Extremal problems in graph theory (05C35) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(7)- The edge fault-diameter of Cartesian graph bundles
- Mixed fault diameter of Cartesian graph bundles
- Mixed connectivity of Cartesian graph products and bundles.
- scientific article; zbMATH DE number 5997381 (Why is no real title available?)
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
- The 2-rainbow domination number of Cartesian bundles over cycles
- Edge, vertex and mixed fault diameters
This page was built for publication: Mixed fault diameter of Cartesian graph bundles. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950070)