{"created":"2023-08-02T03:52:43.458391+00:00","id":1424,"links":{},"metadata":{"_buckets":{"deposit":"f3037c7f-304a-4c32-a219-a18cd9d47dfd"},"_deposit":{"created_by":10,"id":"1424","owners":[10],"pid":{"revision_id":0,"type":"depid","value":"1424"},"status":"published"},"_oai":{"id":"oai:repository.lib.tottori-u.ac.jp:00001424","sets":["1:6","2:14","23:38:54:345:346"]},"author_link":["32605","32606"],"item_3_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1973-06-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"6","bibliographicPageStart":"1","bibliographicVolumeNumber":"24","bibliographic_titles":[{"bibliographic_title":"鳥取大学教育学部研究報告. 自然科学","bibliographic_titleLang":"ja"},{"bibliographic_title":"The Journal of the Faculty of Education, Tottori University. Natural science","bibliographic_titleLang":"en"}]}]},"item_3_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"LANDAU proved that the distance from a point with maximum outdegree to any other point is 1 or 2 in a directed complete graph G. Nevertheless, the converse of this theorem does not hold. Namely, even if the distance from a point e of G to any other point is 1 or 2, the point e has not always the maximum outdegree. Then, in this article, extending the theorem of LANDAU, we call a point e of G a \"maximum point\" of G if the distance from e to any other point is 1 or 2, and we denote by max G the set of all maximum points of G. The propose of this article is to study some properties of the set max G and of spanning paths of a directed complete graph G. This article is based on my paper [4] that is polished and improved.","subitem_description_type":"Other"}]},"item_3_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"鳥取大学教育学部"}]},"item_3_relation_16":{"attribute_name":"情報源","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"鳥取大学教育学部研究報告. 自然科学. 1973. 24(1), 1-6."}]}]},"item_3_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"注があるものを除き、この著作物は日本国著作権法により保護されています。 / This work is protected under Japanese Copyright Law unless otherwise noted."}]},"item_3_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00174585","subitem_source_identifier_type":"NCID"}]},"item_3_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"03715965","subitem_source_identifier_type":"ISSN"}]},"item_3_text_33":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Laboratory of Mathematics, Faculty of Education, Tottori University"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"metadata only access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_14cb"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"加藤, 明史"},{"creatorName":"カトウ, アキノブ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"32605","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Kato, Akinobu","creatorNameLang":"en"},{"creatorName":"カトウ, アキノブ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"32606","nameIdentifierScheme":"WEKO"}]}]},"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":"有向完全グラフの極大点と生成通路","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"有向完全グラフの極大点と生成通路","subitem_title_language":"ja"},{"subitem_title":"The Maximum Points and Spanning Paths of a Directed Complete Graph","subitem_title_language":"en"}]},"item_type_id":"3","owner":"10","path":["6","14","346","1712112934794"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2021-11-25"},"publish_date":"2021-11-25","publish_status":"0","recid":"1424","relation_version_is_last":true,"title":["有向完全グラフの極大点と生成通路"],"weko_creator_id":"10","weko_shared_id":-1},"updated":"2024-04-04T00:35:20.251530+00:00"}