Abstract
Let G be a k G -edge connected graph and \(\mathcal{\overline D}_c(G)\) denote the diameter of G after deleting any of its c < k G edges. We prove that if G 1, G 2, ..., G q are k 1-edge connected, k 2-edge connected,..., k q -edge connected graphs and 0 ≤ a 1 < k 1, 0 ≤ a 2 < k 2,..., 0 ≤ a q < k q and a = a 1 + a 2 + ... + a q + (q − 1), then the edge fault-diameter of G, the Cartesian product of G 1, G 2, ..., G q , with a faulty edges is \(\mathcal{\overline D}_{a}(G)\leq \mathcal{\overline D}_{a_1}(G_1)+\mathcal{\overline D}_{a_2}(G_2)+\dots +\mathcal{\overline D}_{a_q}(G_q)+1.\)
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banič, I., Žerovnik, J.: Fault-diameter of Cartesian graph bundles. Inform. Process. Lett. 100, 47–51 (2006)
Banič, I., Žerovnik, J.: Fault-diameter of Cartesian product of graphs. To appear in Advances in Applied Mathematics.
Banič, I., Žerovnik, J.: Fault-diameter of generalized Cartesian products. In: Proceedings of 26th IEEE International Conference on Distributed Computing Systems (Workshops), IEEE Computer Society, Los Alamitos (2006), http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2006.51
Bermond, J.-C., Comellas, F., Hsu, D.: Distributed loop computer networks: a survey. J. Parallel Distrib. Comput. 24, 2–10 (1995)
Cull, P., Larson, S.M.: On generalized twisted cubes. Inform. Process. Lett. 55, 53–55 (1995)
Du, D.Z., Hsu, D.F., Lyuu, Y.D.: On the diameter vulnerability of kautz digraphs. Discrete Math. 151, 81–85 (2000)
Day, K., Al-Ayyoub, A.: Minimal fault diameter for highly resilient product networks. IEEE Trans. Parallel Distrib. Syst. 11, 926–930 (2000)
Efe, K.: A variation on the hypercube with lower diameter. IEEE Trans. Comput. 40, 1312–1316 (1991)
Imrich, W., Klavžar, S.: Products Graphs, Structure and Recognition. Wiley, New York (2000)
Imrich, W., Žerovnik, J.: Factoring Cartesian-product graphs. J. Graph Theory 18(6), 557–567 (1994)
Imrich, W., Žerovnik, J.: On the weak reconstruction of Cartesian-product graphs. Discrete math. 150, 167–178 (1996)
Imrich, W., Zmazek, B., Žerovnik, J.: Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 21, 273–285 (2003)
Krishnamoorthy, M., Krishnamurty, B.: Fault diameter of interconnection networks. Comput. Math. Appl. 13(5-6), 577–582 (1987)
Liaw, S.C., et al.: Fault-tolerant routing in circulant networks and cycle prefix networks. Ann. Comb. 2(5-6), 165–172 (1998)
Munoz, X.: Asymptotically optimal (δ,d′,s)-digraphs. Ars. Combin. 49, 97–111 (1998)
Stojmenović, I.: Multiplicative circulant networks: Topological properties and communication algorithms. Discrete Applied Math. 77, 281–305 (1997)
West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)
Xu, M., Xu, J.-M., Hou, X.-M.: Fault diameter of cartesian product graphs. Inform. Process. Lett. 93, 245–248 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Banič, I., Žerovnik, J. (2007). Edge Fault-Diameter of Cartesian Product of Graphs. In: Prencipe, G., Zaks, S. (eds) Structural Information and Communication Complexity. SIROCCO 2007. Lecture Notes in Computer Science, vol 4474. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72951-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-72951-8_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72918-1
Online ISBN: 978-3-540-72951-8
eBook Packages: Computer ScienceComputer Science (R0)