Ou, On optimizing edge connectivity of product graphs, Discrete Mathematics 311(6) (2011) 478-492

· 2011

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

math.CO · 2026-04-13 · unverdicted · novelty 6.0

For maximally edge-connected G, G ⊠ C_n is maximally 3-restricted edge-connected and λ₃(G ⊠ K_n) is determined.

Showing 1 of 1 citing paper.

The 3-restricted Edge-Connectivity of Strong Product Graphs math.CO · 2026-04-13 · unverdicted · none · ref 11
For maximally edge-connected G, G ⊠ C_n is maximally 3-restricted edge-connected and λ₃(G ⊠ K_n) is determined.