Abstract
Let G be a graph and S ⊂ V(G). We denote by α(S) the maximum number of pairwise nonadjacent vertices in S. For x, y ∈ V(G), the local connectivity κ(x, y) is defined to be the maximum number of internally-disjoint paths connecting x and y in G. We define \(\kappa(S)=\min\{\kappa(x,y) : x,y \in S,x\not=y\}\). In this paper, we show that if κ(S) ≥ 3 and \(\sum_{i=1}^4 d_{G}{(x_i)} \ge |V(G)|+\kappa(S)+\alpha (S)-1\) for every independent set {x 1, x 2, x 3, x 4} ⊂ S, then G contains a cycle passing through S. This degree condition is sharp and this gives a new degree sum condition for a 3-connected graph to be hamiltonian.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bauer, D., Broersma, H.J., Li, R., Veldman, H.J.: A generalization of a result of Häggkvist and Nicoghossian. J. Combin. Theory Ser. B 47, 237–243 (1989)
Bondy, J.A.: A remark on two sufficient conditions for Hamilton cycles. Discrete Math. 22, 191–193 (1978)
Bondy, J.A.: Basic graph theory - paths and cycles. Handbook of Combinatorics, Vol. I (Elsevier, Amsterdam, 1995) 5–110
Broersma, H.J., Li, H., Li, J., Tian, F., Veldman, H.J.: Cycles through subsets with large degree sum. Discrete Math. 171, 43–54 (1997)
Chvátal, V., Erdős, P.: A note on hamiltonian circuits. Discrete Math. 2, 111–113 (1972)
Harkat-Benhamdine, A., Li, H., Tian, F.: Cyclability of 3-connected graphs. J. Graph Theory 34, 191–203 (2000)
Lu, M., Liu, H., Tian, F.: Two sufficient conditions for dominating cycles. J. Graph Theory 49, 135–150 (2005)
Ore, O.: Note on Hamilton circuits. Amer. Math. Monthly 67, 55 (1960)
Ota, K.: Cycles through prescribed vertices with large degree sum. Discrete Math. 145, 201–210 (1995)
Shi, R.H.: 2-neighborhoods and hamiltonian conditions. J. Graph Theory 16, 267–271 (1992)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ozeki, K., Yamashita, T. A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph. Graphs and Combinatorics 24, 469–483 (2008). https://doi.org/10.1007/s00373-008-0802-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-008-0802-z