HAMILTONIAN LACEABILITY IN MIDDLE GRAPHS
Journal Title: International Journal of Engineering Sciences & Research Technology - Year 2015, Vol 4, Issue 1
Abstract
This paper is aimed to discuss Hamiltonian laceability in the context of the Middle graph of a graph. We explore laceability properties of the Middle graph of the Gear graph, Fan graph, Wheel graph, Path and Cycle.
Authors and Affiliations
Keywords
Related Articles
- EP ID EP142598
- DOI -
- Views 67
- Downloads 0
Pre-Processing Approach for Discrimination Prevention in Data Mining
Data mining is an important technology for extracting useful knowledge hidden in large collections of data. In data mining, discrimination is a very important issue when considering the legal and ethical aspects o...
ESTIMATION OF ROAD SURFACE ROUGHNESS CONDITION FROM ANDROID SMARTPHONE SENSORS
In day to day life transport to the desired location is the most common activity. Road plays vital role in the whole process of transportation. It is necessary that road condition should not be bad in any case for...
Intuitionistic (α, β)- Fuzzy Hv-Subgroups
Atanassov introduced the notion of intuitionistic fuzzy sets as a generalization of the notion of fuzzy sets. In this paper we introduce the concept of an intuitionistic (α β, ) -fuzzy Hv-subgroups of an Hv-groups...
Analytical and Experimental Study of Buckling Behavior of Cylindrical Panels
Thin walled structural components such as plates and shells are used in several applications like aerospace, naval, nuclear plant, pressure vessels, mechanical and civil structures due to their high strength to we...
TEXT INFORMATION EXTRACTION USING RULE BASED METHOD
Information is hidden in large volume of files thus it is necessary to find useful information and extract it from file contents. Information Extraction (IE) is the task of automatically extracting structured informati...