WEKO3
アイテム
{"_buckets": {"deposit": "2deb0cfe-484a-4d9d-8645-dfcce5c89760"}, "_deposit": {"created_by": 3, "id": "14231", "owners": [3], "pid": {"revision_id": 0, "type": "depid", "value": "14231"}, "status": "published"}, "_oai": {"id": "oai:kokushikan.repo.nii.ac.jp:00014231", "sets": ["1158"]}, "author_link": ["22362", "22361"], "item_10002_biblio_info_168": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2019-03-20", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "14", "bibliographicPageStart": "10", "bibliographicVolumeNumber": "40", "bibliographic_titles": [{"bibliographic_title": "国士舘大学紀要情報科学"}, {"bibliographic_title": "MEMOIRS OF THE KOKUSHIKAN UNIVERSITY INFORMATION SCIENCE", "bibliographic_titleLang": "en"}]}]}, "item_10002_description_151": {"attribute_name": "著者ID", "attribute_value_mlt": [{"subitem_description": "J-GLOBAL ID : 201801010867514825", "subitem_description_type": "Other"}, {"subitem_description": "VIAF ID : 113156009848949580850", "subitem_description_type": "Other"}]}, "item_10002_description_161": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Abstract: A graph G Is called strongly k-indexable if there exists a bijective function f : V (G) →{0, 1,...,|V (G)| - 1} such that each uv ∈ E (G) is labeled f (u) + f (v) and the resulting edge labels is {k, k+1,...,k+|E (G)| - 1} for some positive integer k. The edge dependent characteristic of graph G is either the smallest nonnegative integer n with the property that G∪_nK_2 is strongly k-indexable for some positive integer k or +∞ if there exists no such integer n. In this paper, We provide the formula for the edge dependent characteristic of all cycle, which settles the question raised by Hegde and Shetty", "subitem_description_type": "Abstract"}]}, "item_10002_description_180": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_10002_heading_148": {"attribute_name": "見出し", "attribute_value_mlt": [{"subitem_heading_banner_headline": "論文", "subitem_heading_language": "ja"}, {"subitem_heading_banner_headline": "Paper", "subitem_heading_language": "en"}]}, "item_10002_publisher_169": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "国士舘大学全学教養教育運営センター情報科学部会"}]}, "item_10002_source_id_170": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "2187-9516", "subitem_source_identifier_type": "ISSN"}]}, "item_10002_subject_177": {"attribute_name": "NDC", "attribute_value_mlt": [{"subitem_subject": "410", "subitem_subject_scheme": "NDC"}]}, "item_10002_text_185": {"attribute_name": "異なりアクセス1", "attribute_value_mlt": [{"subitem_text_value": "第四十号 No. 40 March, 2019"}]}, "item_10002_textarea_160": {"attribute_name": "著作関係者詳細", "attribute_value_mlt": [{"subitem_textarea_value": "Akito Oshima : Graph Theory and Applications Research Group, School of Electrical Engineering and Computer Science, Faculty of Engineering and Built Environment, The University of Newcastle."}]}, "item_10002_textarea_183": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_textarea_value": "Edge dependent characteristic | strongly k-indexable labeling | super edge-magic labeling | graph labeling | cycle"}]}, "item_10002_textarea_186": {"attribute_name": "異なりアクセス2", "attribute_value_mlt": [{"subitem_textarea_value": "国士館\n一島力男 イチシマリキオ いちしまりきお Rikio Itisima Rikio Ichisima Rikio Itishima\nオオシマアキト おおしまあきと Akito Osima Akito Ooshima Akito Oosima Akito Ohshima Akito Ohsima"}]}, "item_10002_textarea_188": {"attribute_name": "更新履歴", "attribute_value_mlt": [{"subitem_textarea_value": "本文をテキスト認識PDFに差替 20200127"}]}, "item_10002_version_type_181": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Ichishima, Rikio"}], "nameIdentifiers": [{"nameIdentifier": "22361", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Oshima, Akito"}], "nameIdentifiers": [{"nameIdentifier": "22362", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2020-01-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "2187_9516_040_02.pdf", "filesize": [{"value": "1.3 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 1300000.0, "url": {"label": "本文", "url": "https://kokushikan.repo.nii.ac.jp/record/14231/files/2187_9516_040_02.pdf"}, "version_id": "e0945c24-0023-4b42-b60c-0573bf6f0e6a"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "The Edge Dependent Characteristic of Cycles", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "The Edge Dependent Characteristic of Cycles", "subitem_title_language": "en"}]}, "item_type_id": "10002", "owner": "3", "path": ["1158"], "permalink_uri": "https://kokushikan.repo.nii.ac.jp/records/14231", "pubdate": {"attribute_name": "公開日", "attribute_value": "2020-01-20"}, "publish_date": "2020-01-20", "publish_status": "0", "recid": "14231", "relation": {}, "relation_version_is_last": true, "title": ["The Edge Dependent Characteristic of Cycles"], "weko_shared_id": 3}
The Edge Dependent Characteristic of Cycles
https://kokushikan.repo.nii.ac.jp/records/14231
https://kokushikan.repo.nii.ac.jp/records/1423186c7ff4b-a8fc-4d71-90f9-3a1dd82e804b
名前 / ファイル | ライセンス | アクション |
---|---|---|
本文 (1.3 MB)
|
|
Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2020-01-20 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | The Edge Dependent Characteristic of Cycles | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
見出し | ||||||
大見出し | 論文 | |||||
言語 | ja | |||||
見出し | ||||||
大見出し | Paper | |||||
言語 | en | |||||
著者 |
Ichishima, Rikio
× Ichishima, Rikio× Oshima, Akito |
|||||
著者ID | ||||||
内容記述タイプ | Other | |||||
内容記述 | J-GLOBAL ID : 201801010867514825 | |||||
著者ID | ||||||
内容記述タイプ | Other | |||||
内容記述 | VIAF ID : 113156009848949580850 | |||||
著作関係者詳細 | ||||||
Akito Oshima : Graph Theory and Applications Research Group, School of Electrical Engineering and Computer Science, Faculty of Engineering and Built Environment, The University of Newcastle. | ||||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | Abstract: A graph G Is called strongly k-indexable if there exists a bijective function f : V (G) →{0, 1,...,|V (G)| - 1} such that each uv ∈ E (G) is labeled f (u) + f (v) and the resulting edge labels is {k, k+1,...,k+|E (G)| - 1} for some positive integer k. The edge dependent characteristic of graph G is either the smallest nonnegative integer n with the property that G∪_nK_2 is strongly k-indexable for some positive integer k or +∞ if there exists no such integer n. In this paper, We provide the formula for the edge dependent characteristic of all cycle, which settles the question raised by Hegde and Shetty | |||||
書誌情報 |
国士舘大学紀要情報科学 en : MEMOIRS OF THE KOKUSHIKAN UNIVERSITY INFORMATION SCIENCE 巻 40, p. 10-14, 発行日 2019-03-20 |
|||||
出版者 | ||||||
出版者 | 国士舘大学全学教養教育運営センター情報科学部会 | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 2187-9516 | |||||
NDC | ||||||
主題Scheme | NDC | |||||
主題 | 410 | |||||
フォーマット | ||||||
内容記述タイプ | Other | |||||
内容記述 | application/pdf | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
キーワード | ||||||
Edge dependent characteristic | strongly k-indexable labeling | super edge-magic labeling | graph labeling | cycle |