Konu "Hamiltonian laceable graph" için listeleme
Toplam kayıt 2, listelenen: 1-2
-
Laceability properties in edge tolerant corona product graphs
(Işık University Press, 2020)A connected graph G is termed Hamiltonian-t-laceable if there exists in it a Hamiltonian path between every pair of vertices u and v with the property d(u, v) = t, 1 ≤ t ≤ diam(G), where t is a positive integer. The corona ... -
Laceability properties in the image graph of Prism graphs
(Işık University Press, 2023-10)A connected graph G is termed Hamiltonian-t-laceable if there exists in it a Hamiltonian path between every pair of vertices u and v with the property d(u, v) = t, 1 ? t ? diam(G), where t is a positive integer. In this ...