WEKO3
アイテム
{"_buckets": {"deposit": "f80b8fa1-2499-4bac-b74e-19eca503c1fb"}, "_deposit": {"id": "32066", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "32066"}, "status": "published"}, "_oai": {"id": "oai:tsukuba.repo.nii.ac.jp:00032066", "sets": ["2909", "2908"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2014", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "2", "bibliographicPageEnd": "359", "bibliographicPageStart": "353", "bibliographicVolumeNumber": "34", "bibliographic_titles": [{"bibliographic_title": "Discussiones mathematicae graph theory"}]}]}, "item_5_creator_3": {"attribute_name": "著者別名", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "佐野, 良夫"}], "nameIdentifiers": [{"nameIdentifier": "109815", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "20650261", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://nrid.nii.ac.jp/ja/nrid/1000020650261"}, {"nameIdentifier": "0000003333", "nameIdentifierScheme": "筑波大学研究者総覧", "nameIdentifierURI": "http://trios.tsukuba.ac.jp/researcher/0000003333"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "The niche graph of a digraph D is the (simple undirected) graph which\nhas the same vertex set as D and has an edge between two distinct vertices\nx and y if and only if N+\nD(x) ∩ N+\nD(y) 6= ∅ or N−\nD(x) ∩ N−\nD(y) 6= ∅, where\nN+\nD(x) (resp. N−\nD(x)) is the set of out-neighbors (resp. in-neighbors) of x in\nD. A digraph D = (V,A) is called a semiorder (or a unit interval order ) if\nthere exist a real-valued function f : V → R on the set V and a positive real\nnumber \u000e ∈ R such that (x, y) ∈ A if and only if f(x) \u003e f(y)+\u000e. A digraph\nD = (V,A) is called an interval order if there exists an assignment J of a\nclosed real interval J(x) ⊂ R to each vertex x ∈ V such that (x, y) ∈ A if\nand only if min J(x) \u003e max J(y).\nKim and Roberts characterized the competition graphs of semiorders and\ninterval orders in 2002, and Sano characterized the competition-common\nenemy graphs of semiorders and interval orders in 2010. In this note, we\ngive characterizations of the niche graphs of semiorders and interval orders.", "subitem_description_type": "Abstract"}]}, "item_5_publisher_27": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "University of Zielona Góra"}]}, "item_5_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "10.7151/dmgt.1741", "subitem_relation_type_select": "DOI"}}]}, "item_5_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_5_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1234-3099", "subitem_source_identifier_type": "ISSN"}]}, "item_5_subject_20": {"attribute_name": "NIIサブジェクト", "attribute_value_mlt": [{"subitem_subject": "数学", "subitem_subject_scheme": "Other"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": " Park, Jeongmi"}], "nameIdentifiers": [{"nameIdentifier": "109784", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": " Sano, Yoshio"}], "nameIdentifiers": [{"nameIdentifier": "109785", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2015-01-15"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "DMGT_34-2.pdf", "filesize": [{"value": "48.6 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 48600.0, "url": {"label": "DMGT_34-2.pdf ", "url": "https://tsukuba.repo.nii.ac.jp/record/32066/files/DMGT_34-2.pdf"}, "version_id": "a72221f7-3e30-4eae-a99d-705ac4a5b77d"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "THE NICHE GRAPHS OF INTERVAL ORDERS", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "THE NICHE GRAPHS OF INTERVAL ORDERS"}]}, "item_type_id": "5", "owner": "1", "path": ["2909", "2908"], "permalink_uri": "http://hdl.handle.net/2241/00122912", "pubdate": {"attribute_name": "公開日", "attribute_value": "2015-01-15"}, "publish_date": "2015-01-15", "publish_status": "0", "recid": "32066", "relation": {}, "relation_version_is_last": true, "title": ["THE NICHE GRAPHS OF INTERVAL ORDERS"], "weko_shared_id": 5}
THE NICHE GRAPHS OF INTERVAL ORDERS
http://hdl.handle.net/2241/00122912
http://hdl.handle.net/2241/00122912a1ba44e5-3505-4bf0-b4e4-fdaf058478ee
名前 / ファイル | ライセンス | アクション |
---|---|---|
DMGT_34-2.pdf (48.6 kB)
|
|
Item type | Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2015-01-15 | |||||
タイトル | ||||||
タイトル | THE NICHE GRAPHS OF INTERVAL ORDERS | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Park, Jeongmi
× Park, Jeongmi× Sano, Yoshio |
|||||
著者別名 |
佐野, 良夫
× 佐野, 良夫 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N+ D(x) ∩ N+ D(y) 6= ∅ or N− D(x) ∩ N− D(y) 6= ∅, where N+ D(x) (resp. N− D(x)) is the set of out-neighbors (resp. in-neighbors) of x in D. A digraph D = (V,A) is called a semiorder (or a unit interval order ) if there exist a real-valued function f : V → R on the set V and a positive real number ∈ R such that (x, y) ∈ A if and only if f(x) > f(y)+. A digraph D = (V,A) is called an interval order if there exists an assignment J of a closed real interval J(x) ⊂ R to each vertex x ∈ V such that (x, y) ∈ A if and only if min J(x) > max J(y). Kim and Roberts characterized the competition graphs of semiorders and interval orders in 2002, and Sano characterized the competition-common enemy graphs of semiorders and interval orders in 2010. In this note, we give characterizations of the niche graphs of semiorders and interval orders. |
|||||
書誌情報 |
Discussiones mathematicae graph theory 巻 34, 号 2, p. 353-359, 発行日 2014 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1234-3099 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | 10.7151/dmgt.1741 | |||||
著者版フラグ | ||||||
値 | publisher | |||||
出版者 | ||||||
出版者 | University of Zielona Góra |