Open AccessHamiltonian Laceability in Book Graphs
Author(s) -
Meenakshi Devi,
A Girisha
Publication year - 2022
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/2161/1/012032
Subject(s) - hamiltonian path , combinatorics , hamiltonian (control theory) , mathematics , enhanced data rates for gsm evolution , path (computing) , graph , discrete mathematics , physics , computer science , artificial intelligence , mathematical optimization , computer network
A connected graph network G is a Hamilton- t -laceable (Hamilton- t *-laceable) if Ǝ in G a Hamilton path connecting each pair (at least one pair) of vertices at distance ‘ t ’ in G such that 1 ≤ t ≤ diameter (G). In this paper, we discuss the f -edge-Hamilton- t -laceability of Book and stacked Book graphs, where 1 ≤ t ≤ diameter (G).