On sufficient conditions for a graph to be \(k\)-path-coverable, \(k\)-edge-hamiltonian, Hamilton-connected, traceable and \(k^{-}\)-independent
- 2 December 2020
- journal article
- Published by Ptolemy Scientific Research Press in Open Journal of Discrete Applied Mathematics
- Vol. 3 (3), 66-76
- https://doi.org/10.30538/psrp-odam2020.0045
Abstract
The inverse degree of a graph was defined as the sum of the inverses of the degrees of the vertices. In this paper, we focus on finding sufficient conditions in terms of the inverse degree for a graph to be \(k\)-path-coverable, \(k\)-edge-hamiltonian, Hamilton-connected and traceable, respectively. The results obtained are not dropped.