2022-05-21T16:23:54Zhttps://niigata-u.repo.nii.ac.jp/oaioai:niigata-u.repo.nii.ac.jp:000302442021-03-01T10:15:33Z混成木グラフとその均衡性混成木グラフとその均衡性Hybrid Tree Graphs and the Balance of Them仙石, 正和In graph theory, a tree or a cotree is an important concept not only for the sake of its applications to many different fields, but also to graph theory itself. A hybrid tree in a linear graph is a generalized concept of a tree and a cotree. And thus, to examine the properties of hybrid trees seems to be of considerable importance. In this paper, a set of hybrid trees in a linear graph is classified according to the number of edges in the element of it, and a hybrid tree graph is defined as a linear graph which represents the relations among the elements of the set of hybrid trees. And it is shown that a hybrid tree graph is balanced. Using this property, the relationships between the above classification of a set of hybrid trees and the structure of the hybrid tree graph are presented. These results are useful in the realization of a hybrid tree graph.北海道大学1972-12jpndepartmental bulletin paperhttp://hdl.handle.net/10191/22365https://niigata-u.repo.nii.ac.jp/records/30244AN002302230385602X北海道大学工学部研究報告北海道大学工学部研究報告658186https://niigata-u.repo.nii.ac.jp/record/30244/files/S65_81-86.pdfapplication/pdf506.6 kB2019-08-21