The Property of Hamiltonian Connectedness in Toeplitz Graphs

Ayesha Shabbir, Muhammad Faisal Nadeem and Tudor Zamfirescu

Complexity, 2020, vol. 2020, 1-6

Abstract:

A spanning path in a graph G is called a Hamiltonian path. To determine which graphs possess such paths is an NP-complete problem. A graph G is called Hamiltonian-connected if any two vertices of G are connected by a Hamiltonian path. We consider here the family of Toeplitz graphs. About them, it is known only for that is Hamiltonian-connected, while some particular cases of for and have also been investigated regarding Hamiltonian connectedness. Here, we prove that the nonbipartite Toeplitz graph is Hamiltonian-connected for all and .

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2020/5608720.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2020/5608720.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:5608720

DOI: 10.1155/2020/5608720

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().