福州大学学报（自然科学版）2007，Vol.35Issue(1)：16-19,4.
关于两条路的盒叉积的消圈数
Decycling number of box-cross product of two paths
摘要
Abstract
We discuss the decycling number of box-cross product of two paths. For general graphs G1 and G2, a sharp lower bound and a sharp upper bound of the decycling number of box-cross product graph G1(×)G2 are given. And for twopaths Pm and Pn which contain m and n vertices respectively, we prove that φ(Pm(×)Pn) = min { m ·「n/2」,n·m/2」}.关键词
消圈数/盒叉积/路Key words
decycling number/box-cross product/path分类
数理科学引用本文复制引用
谢锦山..关于两条路的盒叉积的消圈数[J].福州大学学报（自然科学版）,2007,35(1):16-19,4.基金项目
福建省自然科学基金资助项目(Z0511017) （Z0511017）
