Index Link

  • RootNode

Item

{"_buckets": {"deposit": "8efe4edc-4ef5-405b-94c9-e2c4d6823cc3"}, "_deposit": {"id": "589", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "589"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/589", "sets": ["1582967046255", "user-um"]}, "communities": ["um"], "control_number": "589", "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Relations Between SomePieces in The Game of Chess and Some Properties of Graphs", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "In this paper, the necessary conditions for a bipartite graph to be Hamiltonian are first discussed. Relating these conditions, the movements of a chess piece called Knight, in the game of chess are discussed. And it is shown that finding a Hamiltonian cycle in a given bipartite graph of 64 vertices is equivalent to finding a reentrant Knight’s tour on a8 x 8 chessboard. Furthermore, the domination concepts of graphs are discussed. Relating these conditions, the movements of a chess piece called Queen are discussed. And it is shown that finding the independence number andindependent domination number of a given graph of 64 vertices areequivalent to finding respectively the maximum number of Queenswhich control each square and the minimum number of attackingQueens and non-attacking Queens on a8 x 8 chessboard."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Bipartite Graph"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-05-05"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Relations Between SomePieces in The Game of Chess pdf.pdf", "filesize": [{"value": "453 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 453000.0, "url": {"url": "https://meral.edu.mm/record/589/files/Relations Between SomePieces in The Game of Chess pdf.pdf"}, "version_id": "7a047c5d-d587-4a84-b1ea-d15f70c6b05b"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "4", "subitem_journal_title": "Universities Research Journal, Department of Higher Education", "subitem_volume": "7"}]}, "item_1583103147082": {"attribute_name": "Conference papaers", "attribute_value_mlt": [{}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_supervisor(s)": []}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Shwin Seinn"}]}]}, "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": "2016"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "https://umoar.mu.edu.mm/handle/123456789/237"}, "item_title": "Relations Between SomePieces in The Game of Chess and Some Properties of Graphs", "item_type_id": "21", "owner": "1", "path": ["1582967046255"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000000589", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-03-05"}, "publish_date": "2020-03-05", "publish_status": "0", "recid": "589", "relation": {}, "relation_version_is_last": true, "title": ["Relations Between SomePieces in The Game of Chess and Some Properties of Graphs"], "weko_shared_id": -1}

Relations Between SomePieces in The Game of Chess and Some Properties of Graphs

http://hdl.handle.net/20.500.12678/0000000589
5505ba1a-127c-4b11-91c1-0252bbfd66c1
8efe4edc-4ef5-405b-94c9-e2c4d6823cc3
None
Name / File License Actions
Relations Relations Between SomePieces in The Game of Chess pdf.pdf (453 Kb)
Publication type
Journal article
Upload type
Publication
Title
Title Relations Between SomePieces in The Game of Chess and Some Properties of Graphs
Language en
Publication date 2016
Authors
Shwin Seinn
Description
In this paper, the necessary conditions for a bipartite graph to be Hamiltonian are first discussed. Relating these conditions, the movements of a chess piece called Knight, in the game of chess are discussed. And it is shown that finding a Hamiltonian cycle in a given bipartite graph of 64 vertices is equivalent to finding a reentrant Knight’s tour on a8 x 8 chessboard. Furthermore, the domination concepts of graphs are discussed. Relating these conditions, the movements of a chess piece called Queen are discussed. And it is shown that finding the independence number andindependent domination number of a given graph of 64 vertices areequivalent to finding respectively the maximum number of Queenswhich control each square and the minimum number of attackingQueens and non-attacking Queens on a8 x 8 chessboard.
Keywords
Bipartite Graph
Identifier https://umoar.mu.edu.mm/handle/123456789/237
Journal articles
4
Universities Research Journal, Department of Higher Education
7
Conference papaers
Books/reports/chapters
Thesis/dissertations
0
0
views
downloads
Views Downloads

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats