{"_buckets": {"deposit": "3cf978d6-b884-45c1-876b-17e56447348c"}, "_deposit": {"id": "4240", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4240"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4240", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "A Graph Representative Structure for Detecting Automorphic Graphs", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Graphs are prevalently used to model the relationships between objects in various domains. Storing the graphs into large databases is a challengingtask as it deals with efficient space and time management. Unlike item sets inhuge transactional databases, it becomes essential to ensure the consistency ofgraph databases since relationships among edges of a graph are predominant.One of the necessary procedures required is a mechanism to check whether twographs are automorphic(duplicated) or not. Difficulty in identifying and eliminating the automorphic graphs is a challenging problem to the research community. In this paper, we propose a graph representative structure that is calledgraph code. There are three main phases: preprocessing, code generation andcode matching. In preprocessing phase, vertex list, edge list and adjacent edgeinformation are generated for input graph. In code generation, edge dictionaryplays an important role. The edge dictionary and adjacent edge information areused to generate graph codes. In code matching, the new graph code is compared with those of other graphs in graph dataset to determine whether they areautomorphic or not. The experimental results and comparisons offer a positiveresponse to the proposed structure."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "edge dictionary"}, {"interim": "graph automorphism"}, {"interim": "graph code"}, {"interim": "graph representative structure"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-08-09"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "5.A Graph Representative Structure for Detecting Automorphic Graphs.pdf", "filesize": [{"value": "384 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 384000.0, "url": {"url": "https://meral.edu.mm/record/4240/files/5.A Graph Representative Structure for Detecting Automorphic Graphs.pdf"}, "version_id": "a1425169-0a5c-48e9-860f-c90b55bdca47"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "9th International Conference on Genetic and Evolutionary Computing (ICGEC2015)", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Hlaing, Yu Wai"}, {"subitem_authors_fullname": "Oo, Kyaw May"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2015"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1985"}, "item_title": "A Graph Representative Structure for Detecting Automorphic Graphs", "item_type_id": "21", "owner": "1", "path": ["1597824175385"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004240", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-08-09"}, "publish_date": "2019-08-09", "publish_status": "0", "recid": "4240", "relation": {}, "relation_version_is_last": true, "title": ["A Graph Representative Structure for Detecting Automorphic Graphs"], "weko_shared_id": -1}