English

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

Combinatorics 2012-12-20 v1 Discrete Mathematics

Abstract

Mixed fault diameter of a graph GG, \D(a,b)(G) \D_{(a,b)}(G), is the maximal diameter of GG after deletion of any aa vertices and any bb edges. Special cases are the (vertex) fault diameter \DaV=\D(a,0)\D^V_{a} = \D_{(a,0)} and the edge fault diameter \DaE=\D(0,a)\D^E_{a} = \D_{(0,a)}. Let GG be a Cartesian graph bundle with fibre FF over the base graph BB. We show that (1) \Da+b+1V(G)\DaV(F)+\DbV(B)\D^V_{a+b+1}(G)\leq \D^V_{a}(F)+\D^V_{b}(B) when the graphs FF and BB are kFk_F-connected and kBk_B-connected, 0<a<kF0< a < k_F, 0<b<kB0< b < k_B, and provided that \D(a1,1)(F)\DaV(F)\D_{(a-1,1)}(F)\leq \D^{V}_{a} (F) and \D(b1,1)(B)\DbV(B)\D_{(b-1,1)}(B)\leq \D^{V}_{b} (B) and (2) \Da+b+1E(G)\DaE(F)+\DbE(B)\D^E_{a+b+1}(G)\leq \D^E_{a}(F)+\D^E_{b}(B) when the graphs FF and BB are kFk_F-edge connected and kBk_B-edge connected, 0a<kF0\leq a < k_F, 0b<kB0\leq b < k_B, and provided that \DaE(F)2\D^E_{a}(F)\geq 2 and \DbE(B)2\D^E_{b}(B)\geq 2.

Keywords

Cite

@article{arxiv.1212.4670,
  title  = {Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles},
  author = {Janez Žerovnik and Rija Erveš},
  journal= {arXiv preprint arXiv:1212.4670},
  year   = {2012}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1002.2508