Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles

DOI10.1016/j.dam.2014.08.025zbMath1304.05034arXiv1212.4670OpenAlexW1983050905MaRDI QIDQ479023

Janez Žerovnik, Rija Erveš

Publication date: 5 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.4670

zbMATH Keywords

fault toleranceCartesian graph bundleinterconnection networkCartesian graph productedge fault diametermixed fault diametervertex fault diameter

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On strong graph bundles ⋮ Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution ⋮ Topological properties on the diameters of the integer simplex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generalized twisted cubes
• Fault diameter of Cartesian product graphs
• Edge, vertex and mixed fault diameters
• Fault-diameter of Cartesian graph bundles
• Fault diameter of product graphs
• The edge fault-diameter of Cartesian graph bundles
• Fault diameter of interconnection networks
• Large fault-tolerant interconnection networks
• Fault-tolerant routing in circulant networks and cycle prefix networks
• Unique square property and fundamental factorizations of graph bundles
• Recognizing Cartesian graph bundles
• Multiplicative circulant networks. Topological properties and communication algorithms
• Algorithm for recognizing Cartesian graph bundles
• Edge-colorability of graph bundles
• On the diameter vulnerability of Kautz digraphs
• Mixed fault diameter of Cartesian graph bundles
• The fault-diameter of Cartesian products
• On the construction of combinedk-fault-tolerant Hamiltonian graphs
• Wide-diameter of Product Graphs
• Recognizing weighted directed cartesian graph bundles
• On the fault-tolerant diameter and wide diameter of ?-connected graphs
• Edge Fault-Diameter of Cartesian Product of Graphs
• The connectivity function of a graph
• The ILLIAC IV Computer
• On recognizing Cartesian graph bundles

This page was built for publication: Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles