Chargement en cours...
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree
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 bec...
Enregistré dans:
| Publié dans: | Springerplus |
|---|---|
| Auteurs principaux: | , |
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
Springer International Publishing
2016
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5075334/ https://ncbi.nlm.nih.gov/pubmed/27818892 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s40064-016-3473-x |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|