Contents

Ars Combinatoria

  • Research article

On Restricted Edge Connectivity of Strong Product Graphs

Jianping Ou1, Weisheng Zhao1
1Department of Mathematics, Wuyi University, Jiangmen 529020, China
  • Published: 31/10/2015

Abstract

An explicit expression of the restricted edge connectivity of strong product of two triangle-free graphs is presented, which yields a sufficient and necessary condition for these strong product graphs to be super restricted edge connected.

Citation
Jianping Ou, Weisheng Zhao. On Restricted Edge Connectivity of Strong Product Graphs[J], Ars Combinatoria, Volume 123. 55-64. .