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

1
Narendra Pratap Singh
Narendra Pratap Singh
2
Ramu Agrawal
Ramu Agrawal
3
Indra Kumar Paliwal
Indra Kumar Paliwal
1 Gautam Buddh Technical University, Lucknow, India.

Send Message

To: Author

GJCST Volume 12 Issue C14

Article Fingerprint

ReserarchID

CSTSDELF1U3

Efficient Algorithm to Determine whether a given Graph is Hamiltonian or Not with All Possible Paths Banner
  • 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

13 Cites in Articles

References

  1. A Israel,Alfred Wagner,Bruckestein (1999). An Ant Inspired Heuristic for Recognizing Hamiltonian Graphs.
  2. T Cormen,C Leiserson,R Rivest (2009). Introduction to Algorithms.
  3. Narsingh Deo (2000). Graph Theory with Application to Engineering and Computer Science.
  4. Alfred Aho,John Hopcroft,Jefferey Ulman (2008). The Design and Analysis of Computer Algorithms.
  5. Ellis Horowitz,Sataj Sahni,Sanguthevar Rajshekharan (2009). Unknown Title.
  6. Reinhard Diestel (2000). Graph Theory Electronic edition.
  7. Béla Bollobas (1978). The number of 1-factors in 2k-connected graphs.
  8. R Halin (1980). 1 Wissen.
  9. Carsten Thomassen (1983). A theorem on paths in planar graphs.
  10. J Bondy,U Murthy (1976). Graph Theory With Applications.
  11. Fleischner (1991). Unknown Title.
  12. P Seymour (1974). Conclusion.
  13. J Komlos,G Sarkozy,E Szemredi (1976). Issue information - Aims.

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.

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

Download Citation

Issue Cover
GJCST Volume 12 Issue C14
Pg. 11- 17
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Classification
Not Found
Version of record

v1.2

Issue date

October 6, 2012

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 10071
Total Downloads: 2557
2026 Trends
Research Identity (RIN)
Related Research

Published Article

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

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

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

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 Pratap Singh
Narendra Pratap Singh Gautam Buddh Technical University, Lucknow, India.
Ramu Agrawal
Ramu Agrawal
Indra Kumar Paliwal
Indra Kumar Paliwal

Research Journals