关于跳跃图的一点注记

A Note for the Jump Graph of a Graph

图 Ｃ的跳跃图记作Ｊ（Ｃ），其定义为：Ｖ（Ｊ（Ｃ）＝Ｅ（Ｇ），ｅｆ∈Ｅ（Ｊ（Ｃ））当且仅当ｅ、ｆ在Ｃ中不相邻，该文证明：若Ｃ＝（Ｖ，Ｅ）是不含孤立点的图，阶ｐ≥ｑ，边数ｑ≥５且△（Ｃ）≥ｑ／２，则除一类特殊图外，Ｊ（Ｇ）是Ｈ－图从而否定Ｇａｒｙ Ｃｈａｒｔｒａｎｄ等人提出的一个猜想．

Let G be a graph, the jump graph J (G ) of G is the graph with vevtex set E (G ) and ef ∈ E(J(C)) iff e and f do not adjacent in C. h is proved that if C is a graph of other p37 and size q≥ 5, such that 6 (G) ≤q/2, then J(G ) is hamiltonian unless one class of well characterized graphs. Our results show a conjecture is not true.