Contents

Ars Combinatoria

  • Research article

On \(3\)-Restricted Edge Connectivity of Cartesian Product Graphs

Yingying Qin1, Jianping Ou1, Zhiping Xiong1
1Department of Mathematics, Wuyi University, Jiangmen 529020, China
  • Published: 31/01/2012

Abstract

This work presents explicit expressions of the \(3\)-restricted edge connectivity of Cartesian product graphs, which yields some sufficient conditions for the product graphs to be maximally \(3\)-restricted edge connected.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Yingying Qin, Jianping Ou, Zhiping Xiong. On \(3\)-Restricted Edge Connectivity of Cartesian Product Graphs[J], Ars Combinatoria, Volume 103. 233-238. .