一类Snark与k-圈的卡式积图的连通性

摘要

In this paper, by reduction methods proved that the Cartesian product graph Jk×Cm, m≥2 is Z3-connectivity.%本文主要运用约化的方法证明了Flower snark Jk与Cm的卡式积图Jk×Cm是Z3-连通的。