科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let be a graph on vertices. Let when is not complete, otherwise set . A graph is said to be weakly geodesic pancyclic if for each pair of vertices , every shortest -path lies on a cycle of length where is an integer between the length of a shortest cycle containing the -path and . In this paper, we will show that if then is either weakly geodesic pancyclic or belongs to one of four exceptional classes of graphs, which are completely determined. Our results generalize some recent results of Chan et al. (Discret Appl Math 155:1971-1978, 2007).
- 出版日期2016-2
