Sufficient conditions for maximally connected dense graphs
Discrete Mathematics
On computing a conditional edge-connectivity of a graph
Information Processing Letters
Connectivity of generalized prisms over G
ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Large survivable nets and the generalized prisms
Discrete Applied Mathematics
On connectivity of the Cartesian product of two graphs
Applied Mathematics and Computation
Graphs and Digraphs, Fourth Edition
Graphs and Digraphs, Fourth Edition
Connectivity of Regular Directed Graphs with Small Diameters
IEEE Transactions on Computers
Sufficient conditions for λ′-optimality in graphs with girth g
Journal of Graph Theory
On the 3-restricted edge connectivity of permutation graphs
Discrete Applied Mathematics
Edge fault tolerance of super edge connectivity for three families of interconnection networks
Information Sciences: an International Journal
Edge fault tolerance of graphs with respect to super edge connectivity
Discrete Applied Mathematics
The k-restricted edge-connectivity of a product of graphs
Discrete Applied Mathematics
{2,3}-Extraconnectivities of hypercube-like networks
Journal of Computer and System Sciences
| Hi-index | 0.04 |
The product graph G"m*G"p of two given graphs G"m and G"p was defined by Bermond et al. [Large graphs with given degree and diameter II, J. Combin. Theory Ser. B 36 (1984) 32-48]. For this kind of graphs we provide bounds for two connectivity parameters (@l and @l^', edge-connectivity and restricted edge-connectivity, respectively), and state sufficient conditions to guarantee optimal values of these parameters. Moreover, we compare our results with other previous related ones for permutation graphs and cartesian product graphs, obtaining several extensions and improvements. In this regard, for any two connected graphs G"m, G"p of minimum degrees @d(G"m), @d(G"p), respectively, we show that @l(G"m*G"p) is lower bounded by both @d(G"m)+@l(G"p) and @d(G"p)+@l(G"m), an improvement of what is known for the edge-connectivity of G"mxG"p.