Graph bundles generalize the notion of covering graphs and graph products. In, authors
constructed an algorithm that finds a presentation as a nontrivial Cartesian graph bundle for …

A Cartesian graph bundle is a generalization of a graph covering and a Cartesian graph
product. Let G be a kG-edge connected graph and D̄c (G) be the largest diameter of …

The mixed fault diameter D (p, q)(G) is the maximum diameter among all subgraphs
obtained from graph G by deleting p vertices and q edges. A graph is (p, q)+ connected if it …

Let γ (G) be the domination number of a graph G. It is shown that for any κ≥ 0 there exists a
Cartesian graph bundle B█ φF such that γ (B█ φF)= γ (B) γ (F)—2 κ. The domination …

Since the seminal result of Karger, Motwani, and Sudan, algorithms for approximate 3-
coloring have primarily centered around rounding the solution to a Semidefinite Program …

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 …

Mixed fault diameter of a graph G, D (a, b)(G), is the maximal diameter of G after deletion of
any a vertices and any b edges. Special cases are the (vertex) fault diameter D a V= D (a, 0) …

ON VULNERABILITY MEASURES OF NETWORKS Page 1 Croatian Operational Research
Review (CRORR), Vol. 4, 2013 318 ON VULNERABILITY MEASURES OF NETWORKS 1 Rija …

We study strong graph bundles: a concept imported from topology which generalizes both
covering graphs and product graphs. Roughly speaking, a strong graph bundle always …

The mixed fault diameter D (p, q)(G) is the maximum diameter among all subgraphs
obtained from graph G by deleting p vertices and q edges. A graph is (p, q)+ connected if it …