Moore graphs and beyond: A survey of the degree/diameter problem Page 1 Moore graphs
and beyond: A survey of the degree/diameter problem Mirka Miller School of Mathematical …

Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph
products. Let G be a kG-connected graph and Dc (G) denote the diameter of G after deleting …

Let G be a k-connected graph and Dc (G) denote the maximum diameter of G after deleting
any of its c< k vertices. We prove that if G1, G2,…, Gq are k1-connected, k2-connected,…, kq …

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 …

Let G be ak G-edge connected graph and \overlineD_c(G) denote the diameter of G after
deleting any of its c< k G edges. We prove that if G 1, G 2,..., G q are k 1-edge connected, k 2 …

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 …

Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph
products. Let G be a kG-connected graph and D_c (G) denote the diameter of G after …

Fault tolerance and transmission delay of networks are important concepts in network
design. The notions are strongly related to connectivity and diameter of a graph, and have …

Concern about fault tolerance in the design of interconnection networks has aroused interest
in finding large graphs such that the subgraphs obtained by deleting any set of up to s …

Inverse Tension Problems. Page 112 Inverse Tension Problems Çigdem Güler 1,∗ Department
of Mathematics, University of Kaiserslautern 67653 Kaiserslautern, Germany For optimization …