【摘要】 文献［１］提出猜想：每个２─连通ｎ阶简单图都有一个圈覆盖Ｃ，使得｜ｃ｜≤（２ｎ－１）／３。此猜想至今尚未完全证实。本文对路、圈、完全图的若干笛卡尔乘积图和张量乘积图证实了猜想是正确的。更多还原

【Abstract】 The conjecture proposed by Bondy J A,that every 2-connected simple graph G on n vertices admits a collection C of a cycle of G in such a way that |C|<(2n-l) / 3, has not been fully confirmed so far. In this paper,this conjecture is confirmed by a number of cartesion product graphs and tensor product graphs on path, cycle and complete graphs.更多还原