Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
From MaRDI portal
Publication:2144878
DOI10.3934/math.2021235OpenAlexW3128481771MaRDI QIDQ2144878
Asad Khan, Suliman Khan, Sakander Hayat, Muhammad Yasir Hayat Malik, Cao, Jinde
Publication date: 17 June 2022
Published in: AIMS Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/math.2021235
graphNP-complete problemsHamiltonian cycleHamiltonian pathconvex polytopesPlatonic solidsHamilton-connected graphdetour index
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Hamiltonicity of generalized honeycomb torus networks
- Hamilton connected graphs
- Generalized honeycomb torus is Hamiltonian
- Hamiltonian-connected graphs
- Hamiltonian properties of triangular grid graphs
- On the Hamilton connectivity of generalized Petersen graphs
- Hamiltonian-connected tournaments
- Hamiltonian paths and hamiltonian connectivity in graphs
- The square of a block is Hamiltonian connected
- Wiener index and Harary index on Hamilton-connected graphs with large minimum degree
- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
- On the fault-tolerant metric dimension of convex polytopes
- Spectral analogues of Erdős' theorem on Hamilton-connected graphs
- The property of Hamiltonian connectedness in Toeplitz graphs
- Forbidden subgraphs for supereulerian and Hamiltonian graphs
- Binary locating-dominating sets in rotationally-symmetric convex polytopes
- Computing the metric dimension of convex polytopes generated by wheel related graphs
- Some sufficient spectral conditions on Hamilton-connected and traceable graphs
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- A canonical representation of trivalent hamiltonian graphs
- The binary locating-dominating number of some convex polytopes
- Characterizations of derived graphs
- Wiener index of trees: Theory and applications
This page was built for publication: Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications