For maximally edge-connected G, G ⊠ C_n is maximally 3-restricted edge-connected and λ₃(G ⊠ K_n) is determined.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The 3-restricted Edge-Connectivity of Strong Product Graphs
For maximally edge-connected G, G ⊠ C_n is maximally 3-restricted edge-connected and λ₃(G ⊠ K_n) is determined.