Abstract
In this paper, we introduce a new concept — implicit-degrees of vertices of graphs. Related to this concept, a new definition for the closure of a graph is introduced. This closure is obtained by recursively joining pairs of nonadjacent vertices whose implicit-degree sum is at least the order of the graph. A criterion for deciding whether a graph is hamiltonian from its closure is obtained. Two other important results concerning the implicit-degrees of vertices and circumferences of graphs are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bollobas, B.: Extremal Graph Theory. pp. 138–140. London-New York-San Francisco: Academic Press 1978
Dirac, G.A.: Hamilton Circuits and Long Circuits. Ann. Discrete Math.3, 75–92 (1978)
Fan, G.: Personal communication.
Bondy, J.A., Chvatal, V.: A Method in Graph Theory. Discrete Math.15, 111–135 (1976)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Amsterdam-Oxford-New York: North-Holland 1976
Zhu, R.: Circumference in 2-connected Graphs. Qu-Fu Shiyuan Xuebao (J. Qufu Teachers' College) no. 4, 8–9 (1983)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yongjin, Z., Hao, L. & Xiaotie, D. Implicit-degrees and circumferences. Graphs and Combinatorics 5, 283–290 (1989). https://doi.org/10.1007/BF01788680
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788680