Based on the ideas in[9],an integer d<sup>0</sup>（v）,called the implicit degree of v whichsatisfies d<sup>0</sup>（v）≥d（v）,is associated with each vertex v of a graph G.It is proved that ...Based on the ideas in[9],an integer d<sup>0</sup>（v）,called the implicit degree of v whichsatisfies d<sup>0</sup>（v）≥d（v）,is associated with each vertex v of a graph G.It is proved that if theimplicit degree sequence d<sub>1</sub><sup>0</sup>,d<sub>2</sub><sup>0</sup>,…,d<sub>n</sub><sup>0</sup>（where d<sub>1</sub><sup>0</sup>≤d<sub>2</sub><sup>0</sup>≤…≤d<sub>n</sub><sup>0</sup>）of a simple graph G on n≥3vertices satisfiesd<sub>i</sub><sup>0</sup>≤i【n/2（?）d<sub>n-i</sub><sup>0</sup>≥n-i,then G is hamiltonian.This is an improvement of the well-known theorem of Chvatal（[4]）.展开更多
文摘Based on the ideas in[9],an integer d<sup>0</sup>（v）,called the implicit degree of v whichsatisfies d<sup>0</sup>（v）≥d（v）,is associated with each vertex v of a graph G.It is proved that if theimplicit degree sequence d<sub>1</sub><sup>0</sup>,d<sub>2</sub><sup>0</sup>,…,d<sub>n</sub><sup>0</sup>（where d<sub>1</sub><sup>0</sup>≤d<sub>2</sub><sup>0</sup>≤…≤d<sub>n</sub><sup>0</sup>）of a simple graph G on n≥3vertices satisfiesd<sub>i</sub><sup>0</sup>≤i【n/2（?）d<sub>n-i</sub><sup>0</sup>≥n-i,then G is hamiltonian.This is an improvement of the well-known theorem of Chvatal（[4]）.
