1. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree
- Author
-
S. Latha and A. Nagoor Gani
- Subjects
Fuzzy Hamiltonian cycle ,Computer science ,0102 computer and information sciences ,01 natural sciences ,symbols.namesake ,Graph power ,Degree of a vertex in a fuzzy graph ,Wheel graph ,05C85 ,Adjacency matrix ,0101 mathematics ,Multidisciplinary ,Research ,010102 general mathematics ,Fuzzy graph ,Neighbourhood (graph theory) ,Hamiltonian path ,Hypercube graph ,05C38 ,010201 computation theory & mathematics ,Fuzzy Hamiltonian path ,symbols ,Adjacency list ,Regular graph ,05C72 ,Algorithm ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
A Hamiltonian cycle in a graph is a cycle that visits each node/vertex exactly once. A graph containing a Hamiltonian cycle is called a Hamiltonian graph. There have been several researches to find the number of Hamiltonian cycles of a Hamilton graph. As the number of vertices and edges grow, it becomes very difficult to keep track of all the different ways through which the vertices are connected. Hence, analysis of large graphs can be efficiently done with the assistance of a computer system that interprets graphs as matrices. And, of course, a good and well written algorithm will expedite the analysis even faster. The most convenient way to quickly test whether there is an edge between two vertices is to represent graphs using adjacent matrices. In this paper, a new algorithm is proposed to find fuzzy Hamiltonian cycle using adjacency matrix and the degree of the vertices of a fuzzy graph. A fuzzy graph structure is also modeled to illustrate the proposed algorithms with the selected air network of Indigo airlines.
- Published
- 2016