2024-03-29T10:16:39Z
https://niigata-u.repo.nii.ac.jp/oai
oai:niigata-u.repo.nii.ac.jp:00030243
2022-12-15T04:00:48Z
423:721:1290
453:456
On the Realization of a Hybrid Tree Graph
混成木グラフの実現について
混成木グラフの実現について
仙石, 正和
167897
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.
departmental bulletin paper
北海道大学
1973-03
application/pdf
北海道大学工学部研究報告
66
35
42
北海道大学工学部研究報告
AN00230223
0385602X
https://niigata-u.repo.nii.ac.jp/record/30243/files/S66_35-42.pdf
jpn