{"created":"2021-03-01T06:36:16.494888+00:00","id":30243,"links":{},"metadata":{"_buckets":{"deposit":"a51b23a8-849b-4aa1-9123-bcd7995f29e1"},"_deposit":{"id":"30243","owners":[],"pid":{"revision_id":0,"type":"depid","value":"30243"},"status":"published"},"_oai":{"id":"oai:niigata-u.repo.nii.ac.jp:00030243","sets":["423:721:1290","453:456"]},"item_7_alternative_title_1":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"On the Realization of a Hybrid Tree Graph"}]},"item_7_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1973-03","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"42","bibliographicPageStart":"35","bibliographicVolumeNumber":"66","bibliographic_titles":[{"bibliographic_title":"北海道大学工学部研究報告"},{"bibliographic_title":"北海道大学工学部研究報告","bibliographic_titleLang":"en"}]}]},"item_7_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"A hybrid tree on a linear graph is a generalized concept of a tree and a cotree. A hybrid tree graph is a linear graph which represents the relations among the elements of the set of hybrid trees. In this paper, some properties of a hybrid tree graph of a connected linear graph G are investigated. And an algorithm for finding a cut set matrix of the graph which realizes the given subgraph (the local subgraph) of a hybrid tree graph is presented. An interesting property of a hybrid tree graph HT_g of G, that is, HT_g is balanced, is used for classification of edges in G. These results show that only a local subgraph of the hybrid tree graph HT_g and the sign of edges of a tree on the subgraph are the sufficient knowledge for the realization of the set of hybrid trees.","subitem_description_type":"Abstract"}]},"item_7_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"167898","nameIdentifierScheme":"WEKO"}],"names":[{"name":"Sengoku, Masakazu"}]}]},"item_7_publisher_7":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"北海道大学"}]},"item_7_select_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_7_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00230223","subitem_source_identifier_type":"NCID"}]},"item_7_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0385602X","subitem_source_identifier_type":"ISSN"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"仙石, 正和"}],"nameIdentifiers":[{"nameIdentifier":"167897","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-08-21"}],"displaytype":"detail","filename":"S66_35-42.pdf","filesize":[{"value":"542.8 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"S66_35-42.pdf","url":"https://niigata-u.repo.nii.ac.jp/record/30243/files/S66_35-42.pdf"},"version_id":"3434f15f-0152-4b10-a309-16a1595bab8f"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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":"混成木グラフの実現について","subitem_title_language":"en"}]},"item_type_id":"7","owner":"1","path":["456","1290"],"pubdate":{"attribute_name":"公開日","attribute_value":"2013-05-17"},"publish_date":"2013-05-17","publish_status":"0","recid":"30243","relation_version_is_last":true,"title":["混成木グラフの実現について"],"weko_creator_id":"1","weko_shared_id":null},"updated":"2022-12-15T04:00:48.396003+00:00"}