On sufficient conditions for a graph to be k -path-coverable, k -edge-hamiltonian, Hamilton-connected, traceable and k − -independent

Li, Junjiang and Su, Guifu and Shi, Huichao and Liu, Fuguo (2020) On sufficient conditions for a graph to be k -path-coverable, k -edge-hamiltonian, Hamilton-connected, traceable and k − -independent. Open Journal of Discrete Applied Mathematics, 3 (3). pp. 66-76. ISSN 26179679

[thumbnail of on-sufficient-conditions-for-a-graph-to-be-k-path-coverable-k-edge-hamiltonian-hamilton-connected-traceable-and-k-independent.pdf] Text
on-sufficient-conditions-for-a-graph-to-be-k-path-coverable-k-edge-hamiltonian-hamilton-connected-traceable-and-k-independent.pdf - Published Version
Download (454kB)

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.

Item Type: Article
Subjects: Research Scholar Guardian > Mathematical Science
Depositing User: Unnamed user with email support@scholarguardian.com
Date Deposited: 11 Feb 2023 09:12
Last Modified: 19 Sep 2023 06:27
URI: http://science.sdpublishers.org/id/eprint/163

Actions (login required)

View Item
View Item