Abstract
One of the earliest results about hamiltonian graphs was given by Dirac. He showed that if a graph G has order p and minimum degree at least \(\frac{p} {2}\) then G is hamiltonian. Moon and Moser showed that if G is a balanced bipartite graph (the two partite sets have the same order) with minimum degree more than \(\frac{p} {4}\) then G is hamiltonian. Recently their idea is generalized to k-partite graphs by Chen, Faudree, Gould, Jacobson, and Lesniak in terms of minimum degrees. In this paper, we generalize this result in terms of degree sum and the following result is obtained: Let G be a balanced k-partite graph with order kn. If for every pair of nonadjacent vertices u and v which are in different parts
then G is hamiltonian.
Similar content being viewed by others
References
Ainouche, A.: An Improvement of Fraisse’s Sufficient Condition for Hamiltonian Graphs. J. Graph Theory 16, 529–543 (1992)
Ainouche, A., Schiermeyer, I.: Insertible vertices, neighborhood intersections and hamiltonicity, Preprint.
Bondy, J.A., Chvátal V.: A Method in Graph Theory. Discrete Math. 15, 111–135 (1976)
Chen, G., Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Hamiltonicity on Balanced k-partite Graphs. Graphs and Comb. 11, 221–231 (1995)
Chen, G., Liu, Y.: Hamiltonian Graphs with Large Neighborhood Unions. ARS. Combinatoria (to be published)
Chen, G., Schelp, H.R.: Hamiltonicity for K 1, r -free Graphs, J. of Graph Theory (to be published)
Dirac, G.: Some theorems on abstract graphs. Proc. London Math. Soc. 2, 69–81 (1952)
Liu, Y., Tian, F., Wu, Z.: A K-Hamiltonian-Nice Sequence, Preprint.
Moon, J., Moser, L.: On hamiltonian bipartite graphs, Israel J. Math. 1, 163–165 (1963)
Ore, O.: Note on hamiltonian circuits. Amer. Math. Monthly 67, 55 (1990)
Zhang, C.Q.: Hamilton Cycle in Claw-Free Graphs. J. Graph Theory 12–2, 209–216 (1988)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by N.S.A. grant # MDA 904-95-1-1091
Research supported by O.N.R. grant # N00014-J-91-1098
Rights and permissions
About this article
Cite this article
Chen, G., Jacobson, M.S. Degree Sum Conditions for Hamiltonicity on k-Partite Graphs. Graphs and Combinatorics 13, 325–343 (1997). https://doi.org/10.1007/BF03353011
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03353011