{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:39Z","timestamp":1725512139368},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729181"},{"type":"electronic","value":"9783540729518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72951-8_19","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T00:03:25Z","timestamp":1183334605000},"page":"234-245","source":"Crossref","is-referenced-by-count":2,"title":["Edge Fault-Diameter of Cartesian Product of Graphs"],"prefix":"10.1007","author":[{"given":"Iztok","family":"Bani\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janez","family":"\u017derovnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ipl.2006.05.010","volume":"100","author":"I. Bani\u010d","year":"2006","unstructured":"Bani\u010d, I., \u017derovnik, J.: Fault-diameter of Cartesian graph bundles. Inform. Process. Lett.\u00a0100, 47\u201351 (2006)","journal-title":"Inform. Process. Lett."},{"key":"19_CR2","unstructured":"Bani\u010d, I., \u017derovnik, J.: Fault-diameter of Cartesian product of graphs. To appear in Advances in Applied Mathematics."},{"key":"19_CR3","volume-title":"Proceedings of 26th IEEE International Conference on Distributed Computing Systems (Workshops)","author":"I. Bani\u010d","year":"2006","unstructured":"Bani\u010d, I., \u017derovnik, 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), \n                    \n                      http:\/\/doi.ieeecomputersociety.org\/10.1109\/ICDCSW.2006.51"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"J.-C. Bermond","year":"1995","unstructured":"Bermond, J.-C., Comellas, F., Hsu, D.: Distributed loop computer networks: a survey. J. Parallel Distrib. Comput.\u00a024, 2\u201310 (1995)","journal-title":"J. Parallel Distrib. Comput."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(95)00040-J","volume":"55","author":"P. Cull","year":"1995","unstructured":"Cull, P., Larson, S.M.: On generalized twisted cubes. Inform. Process. Lett.\u00a055, 53\u201355 (1995)","journal-title":"Inform. Process. Lett."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0012-365X(94)00084-V","volume":"151","author":"D.Z. Du","year":"2000","unstructured":"Du, D.Z., Hsu, D.F., Lyuu, Y.D.: On the diameter vulnerability of kautz digraphs. Discrete Math.\u00a0151, 81\u201385 (2000)","journal-title":"Discrete Math."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/71.879775","volume":"11","author":"K. Day","year":"2000","unstructured":"Day, K., Al-Ayyoub, A.: Minimal fault diameter for highly resilient product networks. IEEE Trans. Parallel Distrib. Syst.\u00a011, 926\u2013930 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1109\/12.102840","volume":"40","author":"K. Efe","year":"1991","unstructured":"Efe, K.: A variation on the hypercube with lower diameter. IEEE Trans. Comput.\u00a040, 1312\u20131316 (1991)","journal-title":"IEEE Trans. Comput."},{"key":"19_CR9","volume-title":"Products Graphs, Structure and Recognition","author":"W. Imrich","year":"2000","unstructured":"Imrich, W., Klav\u017ear, S.: Products Graphs, Structure and Recognition. Wiley, New York (2000)"},{"issue":"6","key":"19_CR10","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1002\/jgt.3190180604","volume":"18","author":"W. Imrich","year":"1994","unstructured":"Imrich, W., \u017derovnik, J.: Factoring Cartesian-product graphs. J. Graph Theory\u00a018(6), 557\u2013567 (1994)","journal-title":"J. Graph Theory"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(95)00185-Y","volume":"150","author":"W. Imrich","year":"1996","unstructured":"Imrich, W., \u017derovnik, J.: On the weak reconstruction of Cartesian-product graphs. Discrete math.\u00a0150, 167\u2013178 (1996)","journal-title":"Discrete math."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.7151\/dmgt.1202","volume":"21","author":"W. Imrich","year":"2003","unstructured":"Imrich, W., Zmazek, B., \u017derovnik, J.: Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory\u00a021, 273\u2013285 (2003)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"5-6","key":"19_CR13","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0898-1221(87)90085-X","volume":"13","author":"M. Krishnamoorthy","year":"1987","unstructured":"Krishnamoorthy, M., Krishnamurty, B.: Fault diameter of interconnection networks. Comput. Math. Appl.\u00a013(5-6), 577\u2013582 (1987)","journal-title":"Comput. Math. Appl."},{"issue":"5-6","key":"19_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01608486","volume":"2","author":"S.C. Liaw","year":"1998","unstructured":"Liaw, S.C., et al.: Fault-tolerant routing in circulant networks and cycle prefix networks. Ann. Comb.\u00a02(5-6), 165\u2013172 (1998)","journal-title":"Ann. Comb."},{"key":"19_CR15","first-page":"97","volume":"49","author":"X. Munoz","year":"1998","unstructured":"Munoz, X.: Asymptotically optimal (\u03b4,d\u2032,s)-digraphs. Ars. Combin.\u00a049, 97\u2013111 (1998)","journal-title":"Ars. Combin."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0166-218X(96)00138-2","volume":"77","author":"I. Stojmenovi\u0107","year":"1997","unstructured":"Stojmenovi\u0107, I.: Multiplicative circulant networks: Topological properties and communication algorithms. Discrete Applied Math.\u00a077, 281\u2013305 (1997)","journal-title":"Discrete Applied Math."},{"key":"19_CR17","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.ipl.2004.11.005","volume":"93","author":"M. Xu","year":"2005","unstructured":"Xu, M., Xu, J.-M., Hou, X.-M.: Fault diameter of cartesian product graphs. Inform. Process. Lett.\u00a093, 245\u2013248 (2005)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72951-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:50Z","timestamp":1605762530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72951-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729181","9783540729518"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72951-8_19","relation":{},"subject":[]}}