ON THE PANCONNECTIVITY OF ORE GRAPH
Xiao-Chao Ca · Science in China Series A-Mathematics Physics Astronomy & Technological Science · 1984
By an Ore graph we mean a simple graph of order n with Ore condition, that is, for eachpair of distinct nonadjacent vertices u and v, d(u)+d(v)≥n. This paper makes the panconnec-tivity of Ore graph clear, and shows results of its vertex (edge) pancyclicity, which are exten-sions of Bondys result.