Mixed connectivity of Cartesian graph products and bundles
Abstract
Mixed connectivity is a generalization of vertex and edge connectivity. A graph is (p,0)-connected, p>0, if the graph remains connected after removal of any p-1 vertices. A graph is (p,q)-connected, p≥ 0, q>0, if it remains connected after removal of any p vertices and any q-1 edges. Cartesian graph bundles are graphs that generalize both covering graphs and Cartesian graph products. It is shown that if graph F is (pF,qF)-connected and graph B is (pB,qB)-connected, then Cartesian graph bundle G with fibre F over the base graph B is (pF+pB,qF+qB)-connected. Furthermore, if qF,qB>0, then G is also (pF+pB+1,qF+qB-1)-connected. Finally, let graphs Gi, i=1,...,n, be (pi,qi)-connected and let k be the number of graphs with qi>0. The Cartesian graph product G=G1 G2 ... Gn is (Σ pi,Σ qi)-connected, and, for k≥ 1, it is also (Σ pi+k-1,Σ qi-k+1)-connected.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.