Hamiltonian Laceability of Some Regular
Product Graphs

K. Sowmya; Leena N Shenoy; G.A. Vatsala

doi:https://doi.org/10.14445/22315373/IJMTT-V52P573

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 52 | Number 8 | Year 2017 | Article Id. IJMTT-V52P573 | DOI : https://doi.org/10.14445/22315373/IJMTT-V52P573

Hamiltonian Laceability of Some Regular Product Graphs

K. Sowmya, Leena N Shenoy, G.A. Vatsala

Abstract

A simple connected graph G is Hamiltonian laceable if there is a Hamiltonian path connecting each pair of distinct vertices at an odd distance. In this, we discuss the Hamiltonian laceability of some regular product graphs.

Keywords

Hamiltonian laceable graph, OR product, AND product and EXOR product.

References

[1] B. Alspach, C. C. Chen, and Kevin MAvaney, On a Class of Hamiltonian Laceable-3-regular Graphs, Disc. Math., 151, (1996), 19-38.
[2]S.Y. Hsieh, G.H. Chen, C.W. Ho,on Hamiltonian- laceability of star graphs Networks, 36 (4) (2000), pp. 225- 232.
[3] Leena N. Shenoy and R Murali, ―Hamiltonian laceability in product graphs‖, International e-journal of Engineering Mathematics: Theory & Applications, Vol. (9), September 2010, pp.1-13.

Citation :

K. Sowmya, Leena N Shenoy, G.A. Vatsala, "Hamiltonian Laceability of Some Regular Product Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 52, no. 8, pp. 521-527, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V52P573