Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Information Processing Letters
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
On the diameter vulnerability of Kautz digraphs
Discrete Mathematics - Special issue on graph theory and combinatorics
Recognizing Cartesian graph bundles
Discrete Mathematics
Multiplicative circulant networks topological properties and communication algorithms
Discrete Applied Mathematics
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
On recognizing Cartesian graph bundles
Discrete Mathematics
Unique square property and fundamental factorizations of graph bundles
Discrete Mathematics - Algebraic and topological methods in graph theory
Algorithm for recognizing Cartesian graph bundles
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Fault-diameter of Cartesian graph bundles
Information Processing Letters
Fault diameter of Cartesian product graphs
Information Processing Letters
Edge fault-diameter of Cartesian product of graphs
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Edge fault-diameter of graph product
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Fault diameters of graph products and bundles
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Mixed fault diameter of Cartesian graph bundles
Discrete Applied Mathematics
Wide-diameter of Product Graphs
Fundamenta Informaticae
| Hi-index | 0.00 |
A Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph product. Let G be a k"G-edge connected graph and D@?"c(G) be the largest diameter of subgraphs of G obtained by deleting c