• A NOTE ON RELATION BETWEEN COMPLETE GRAPHS TO DIRECTED HAMILTONIAN PATH
Abstract
A Hamiltonian Path is a spanning path in a graph, i.e., the path passing through every vertex of the graph. In this paper we study and giving a condition for a Relation Between Complete Graph to Directed Hamiltonian Path and given some related examples.
Keywords
Graph, complete graph, path, Hamiltonian path, Tree, Spanning tree.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |