MERAL Myanmar Education Research and Learning Portal
Item
{"_buckets": {"deposit": "66c17a2b-4280-4021-9f7e-eee8e3a3b5a0"}, "_deposit": {"created_by": 232, "id": "9266", "owner": "232", "owners": [232], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "depid", "value": "9266"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00009266", "sets": ["1704444930107", "1704332280616"]}, "author_link": [], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Sufficient Conditions for Hamiltonian Graphs", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Hamiltonian graphs are named after Sir, Willian Rowan Hamilton, an Irish mathematician, who introduced the problems offinding a cycle in which all vertices of a graph appear exactly once except for the starting and ending vertex that appears twice. In this paper, sufficient conditions for a graph to be Hamiltonian graph are illustrated.Moreover, some applications on Hamiltonian Graph are studied."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "path"}, {"interim": "cycle"}, {"interim": "Hamilton path"}, {"interim": "Hamilton cycle"}, {"interim": "spanning cycle"}, {"interim": "sufficient condition"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2024-01-26"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "4_DrKHT_Meithila University Journal (2020).pdf", "filesize": [{"value": "28.7 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_0", "mimetype": "application/pdf", "size": 28700000.0, "url": {"url": "https://meral.edu.mm/record/9266/files/4_DrKHT_Meithila University Journal (2020).pdf"}, "version_id": "230e960e-4743-4151-9617-8265bd0ec163"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "1", "subitem_journal_title": "Meiktila University Research Journal", "subitem_pages": "272-277", "subitem_volume": "XI"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Khin Hla Thi"}, {"subitem_authors_fullname": "Moe Moe"}, {"subitem_authors_fullname": "Khin Ohn Myint"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Journal article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2020-08-01"}, "item_title": "Sufficient Conditions for Hamiltonian Graphs", "item_type_id": "21", "owner": "232", "path": ["1704332280616", "1704444930107"], "permalink_uri": "https://meral.edu.mm/records/9266", "pubdate": {"attribute_name": "Deposit date", "attribute_value": "2024-01-26"}, "publish_date": "2024-01-26", "publish_status": "0", "recid": "9266", "relation": {}, "relation_version_is_last": true, "title": ["Sufficient Conditions for Hamiltonian Graphs"], "weko_shared_id": -1}
Sufficient Conditions for Hamiltonian Graphs
https://meral.edu.mm/records/9266
https://meral.edu.mm/records/9266e06ce305-6ded-455b-8f1f-37f82b819fc0
66c17a2b-4280-4021-9f7e-eee8e3a3b5a0
Name / File | License | Actions |
---|---|---|
4_DrKHT_Meithila University Journal (2020).pdf (28.7 MB)
|
Publication type | ||||||
---|---|---|---|---|---|---|
Journal article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Sufficient Conditions for Hamiltonian Graphs | |||||
Language | en | |||||
Publication date | 2020-08-01 | |||||
Authors | ||||||
Khin Hla Thi | ||||||
Moe Moe | ||||||
Khin Ohn Myint | ||||||
Description | ||||||
Hamiltonian graphs are named after Sir, Willian Rowan Hamilton, an Irish mathematician, who introduced the problems offinding a cycle in which all vertices of a graph appear exactly once except for the starting and ending vertex that appears twice. In this paper, sufficient conditions for a graph to be Hamiltonian graph are illustrated.Moreover, some applications on Hamiltonian Graph are studied. | ||||||
Keywords | ||||||
path, cycle, Hamilton path, Hamilton cycle, spanning cycle, sufficient condition | ||||||
Journal articles | ||||||
1 | ||||||
Meiktila University Research Journal | ||||||
272-277 | ||||||
XI |