Hamiltonian laceability in the shadow distance graph of path graphs
نویسندگان
چکیده
منابع مشابه
Hamiltonian Path based Shadow Removal
For some computer vision tasks, the presence of shadows in images can cause problems. For example, object tracks can be lost as an object crosses over a shadow boundary. Recently, it has been shown that it is possible to remove shadows from images. Assuming that the location of the shadows are known, shadow-free images are obtained in three steps. First, the image is differentiated. Second, the...
متن کاملOn the Hamiltonian Laceability of Honeycomb Toroidal Graphs
The Honeycomb toroidal graph is a highly symmetric, vertex-transitive, bipartite graph which has been investigated for certain properties including pan-cyclicity and Hamilton laceability. The main focus of this project was to construct generalised methods for finding Hamilton paths and thus provide a proof of Hamilton laceability for this graph. The resulting proof was successful for a subset o...
متن کاملPaired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
A paired many-to-many k-disjoint path cover (paired k-DPC for short) of a graph is a set of k vertex-disjoint paths joining k distinct source-sink pairs that altogether cover every vertex of the graph. We consider the problem of constructing paired 2-DPC’s in an m-dimensional bipartite HL-graph, Xm, and its application in finding the longest possible paths. It is proved that every Xm, m ≥ 4, ha...
متن کاملAdjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs
Let Sn be an n-dimensional Star graph. In this paper, we show that Sn − F is Hamiltonian laceable where F is the set of f ≤ (n − 4) pairs of adjacent faulty vertices, Sn − F is Hamiltonian where F is the set of f ≤ (n − 3) pairs of adjacent faulty vertices. We also show that Sn − F is hyper-Hamiltonian laceable where F is the set of f ≤ (n − 4) pairs of adjacent faulty vertices. Applying these ...
متن کاملHyper hamiltonian laceability on edge fault star graph
The star graph possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n 3)-edge fault tolerant hamiltonian laceable, (n 3)-edge fault tolerant strongly hamiltonian laceable, and (n 4)edge fault tolerant hyper hamiltonian laceable. All these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Malaya Journal of Matematik
سال: 2019
ISSN: 2319-3786,2321-5666
DOI: 10.26637/mjm0701/0023