20.500.12556/DKUM-49377 Fault-diameter of Cartesian product of graphs and Cartesian graph bundles Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let ▫$G$▫ be a ▫$k_G$▫-connected graph and ▫${mathcal{D}}_c(G)$▫ denote the diameter of ▫$G$▫ after deleting any of its ▫$c < k_G$▫ vertices. We prove that if ▫$G_1, G_2, dots, G_q$▫ are ▫$k_1$▫-connected, ▫$k_2$▫-connected,...,▫$k_q$▫-connected graphs and ▫$0 leq a_1 < k_1$▫, ▫$0 leq a_2 < k_2$▫,...,▫$0 leq a_q < k_q$▫ and ▫$a = a_1 + a_2 + dots + a_q + (q-1)$▫, then the fault diameter of ▫$G$▫, a Cartesian product of ▫$G_1$▫, ▫$G_2$▫,...,▫$G_q$▫, with ▫$a$▫ faulty nodes is ▫${mathcal{D}}_{a}(G) leq {mathcal{D}}_{a_1}(G_1)+{mathcal{D}}_{a_2}(G_2) + dots + {mathcal{D}}_{a_q}(G_q) + 1$▫. We also show that ▫${mathcal{D}}_{a+b+1}(G) leq {mathcal{D}}_a(F) + {mathcal{D}}_b(B) + 1$▫ if ▫$G$▫ is a graph bundle with fibre ▫$F$▫ over base ▫$B$▫, ▫$a leq k_F$▫, and ▫$b leq k_B$▫. As an auxiliary result we prove that connectivity of graph bundle ▫$G$▫ is at least ▫$k_F+k_B$▫. mathematics graph theory Cartesian graph bundles Cartesian graph products fault diameter interconnection network true false false Angleški jezik Neznan jezik Delo ni kategorizirano 2015-07-10 12:00:49 2015-07-10 12:00:49 2022-05-27 03:09:28 2019-07-10 21:28:26 2006 0 0 str. 1-17 št. 1016 Vol. 44 2006 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 1318-4865 519.17 44310272 14564441 URN:SI:UM:DK:FUEL9SZJ http://www.imfm.si/preprinti/PDF/01016.pdf 1 https://dk.um.si/Dokument.php?lang=slv&id=73936 Fakulteta za strojništvo 0 0 0