Loading menu…

Efficient Algorithm to Determine whether a given Graph is Hamiltonian or Not with All Possible Paths

§ Gautam Buddh Technical University, Lucknow, India.

Send Message

To: Author

Efficient Algorithm to Determine whether a given Graph is Hamiltonian or Not with All Possible Paths

Article Fingerprint

ReserarchID

CSTSDELF1U3

Efficient Algorithm to Determine whether a given Graph is Hamiltonian or Not with All Possible Paths Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background

References

13 Cites in Article
  1. 1. A Israel,Alfred Wagner,Bruckestein (1999). An Ant Inspired Heuristic for Recognizing Hamiltonian Graphs. IEEE
  2. 2. T Cormen,C Leiserson,R Rivest (2009). Introduction to Algorithms. Introduction to Algorithms
  3. 3. Narsingh Deo (2000). Graph Theory with Application to Engineering and Computer Science. Graph Theory with Application to Engineering and Computer Science, 20-32.
  4. 4. Alfred Aho,John Hopcroft,Jefferey Ulman (2008). The Design and Analysis of Computer Algorithms. The Design and Analysis of Computer Algorithms, 387-393.
  5. 5. Ellis Horowitz,Sataj Sahni,Sanguthevar Rajshekharan (2009). Unknown Title.
  6. 6. Reinhard Diestel (2000). Graph Theory Electronic edition. Graph Theory Electronic edition, 222-237.
  7. 7. Béla Bollobas (1978). The number of 1-factors in 2k-connected graphs. Journal of Combinatorial Theory, Series B, 25(3), 363-366.
  8. 8. R Halin (1980). 1 Wissen. Geschichte: Eine Theorie
  9. 9. Carsten Thomassen (1983). A theorem on paths in planar graphs. Journal of Graph Theory, 7(2), 169-176.
  10. 10. J Bondy,U Murthy (1976). Graph Theory With Applications. Graph Theory With Applications
  11. 11. Fleischner (1991). Unknown Title. J. Combin Theory, 117-123.
  12. 12. P Seymour (1974). Conclusion. OD) Combinatorics
  13. 13. J Komlos,G Sarkozy,E Szemredi (1976). Issue information - Aims. Random Structures & Algorithms, 49(2), 211-211.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Narendra Pratap Singh, Ramu Agrawal, indrapaliwal. 2012. "Efficient Algorithm to Determine whether a given Graph is Hamiltonian or Not with All Possible Paths". Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 12 (GJCST Volume 12 Issue C14).

More Citation Formats

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-C Classification E.1
Version of record
v1.2

Issue date
October 6, 2012

Language
English
Order Article Reprint
Experience in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 2.8K
Total Downloads: 157
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Efficient Algorithm to Determine whether a given Graph is Hamiltonian or Not with All Possible Paths

Narendra Singh
Narendra Singh Gautam Buddh Technical University, Lucknow, India.
Ramu Agrawal
Ramu Agrawal <p>Gautam Buddh Technical University, Lucknow, India.</p>
<p>Gautam Buddh Technical University, Lucknow, India.</p>