![](/images/graphics-bg.png)
The Property of Hamiltonian Connectedness in Toeplitz Graphs
Joint Authors
Shabbir, Ayesha
Nadeem, Muhammad Faisal
Zamfirescu, Tudor
Source
Issue
Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2020-03-12
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
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 n=3 that Tnp,q is Hamiltonian-connected, while some particular cases of Tnp,q,r for p=1 and q=2,3,4 have also been investigated regarding Hamiltonian connectedness.
Here, we prove that the nonbipartite Toeplitz graph Tn1,q,r is Hamiltonian-connected for all 1
American Psychological Association (APA)
Shabbir, Ayesha& Nadeem, Muhammad Faisal& Zamfirescu, Tudor. 2020. The Property of Hamiltonian Connectedness in Toeplitz Graphs. Complexity،Vol. 2020, no. 2020, pp.1-6.
https://search.emarefa.net/detail/BIM-1142482
Modern Language Association (MLA)
Shabbir, Ayesha…[et al.]. The Property of Hamiltonian Connectedness in Toeplitz Graphs. Complexity No. 2020 (2020), pp.1-6.
https://search.emarefa.net/detail/BIM-1142482
American Medical Association (AMA)
Shabbir, Ayesha& Nadeem, Muhammad Faisal& Zamfirescu, Tudor. The Property of Hamiltonian Connectedness in Toeplitz Graphs. Complexity. 2020. Vol. 2020, no. 2020, pp.1-6.
https://search.emarefa.net/detail/BIM-1142482
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1142482