### Abstract

Let S be a set of vertices of a k-connected graph G. We denote the smallest sum of degrees of k + 1 independent vertices of S by σ_{k + 1}(S; G). We obtain a sharp lower bound of σ_{k + 1}(S; G) for the vertices of S to be contained in a common cycle of G. This result gives a sufficient condition for a k-connected graph to be hamiltonian.

Original language | English |
---|---|

Pages (from-to) | 201-210 |

Number of pages | 10 |

Journal | Discrete Mathematics |

Volume | 145 |

Issue number | 1-3 |

DOIs | |

Publication status | Published - 1995 Oct 13 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Cycles through prescribed vertices with large degree sum'. Together they form a unique fingerprint.

## Cite this

Ota, K. (1995). Cycles through prescribed vertices with large degree sum.

*Discrete Mathematics*,*145*(1-3), 201-210. https://doi.org/10.1016/0012-365X(94)00036-I