On the Realization of Tree Graphs
暂无分享,去创建一个
A method for obtaining a cut set matrix of a graph whose tree graph has a local subgraph isomorphic to a prescribed linear graph is presented. The local subgraph of a tree graph with respect to a tree is the subgraph defined by the collection of all the trees whose distance from the tree is one.
[1] Y. Kajitani,et al. On Hamilton Circuits in Tree Graphs , 1968 .
[2] R. Cummins. Hamilton Circuits in Tree Graphs , 1966 .
[3] S. Hakimi,et al. Generation and Realization of Trees and k-Trees , 1964 .
[4] S. L. Hakimi,et al. On trees of a graph and their generation , 1961 .
[5] S. Hakimi. On Realizability of a Set of Trees , 1961 .
[6] O. Ore. Theory of Graphs , 1962 .