Open AccessHypo-edge-Hamiltonian laceability in Graphs
Author(s) -
Shashidhar shekhar neelannavar,
A Girisha
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1597/1/012039
Subject(s) - cartesian product , combinatorics , hamiltonian (control theory) , hamiltonian path , mathematics , graph , discrete mathematics , cartesian coordinate system , geometry , mathematical optimization
A simple connected graph is known to be Hamiltonian- t -laceable if there will be a Hamiltonian path between each pair of distinct vertices at a distance ‘ t ’ in G where t ∈ Z + such that 1 ≤ t ≤ diam(G) . In this paper we define M -flower snark graph and discuss the hypo edge Hamiltonian laceability properties in M -flower snark graphs and Cartesian product graphs.