𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On trees of a graph and their generation

✍ Scribed by S.L. Hakimi

Book ID
107754513
Publisher
Elsevier Science
Year
1961
Tongue
English
Weight
801 KB
Volume
272
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Junction trees of general graphs
Junction trees of general graphs
✍ Xiaofei Wang; Jianhua Guo πŸ“‚ Article πŸ“… 2008 πŸ› Higher Education Press and Springer 🌐 English βš– 186 KB
Generation of trees of a graph with the
Generation of trees of a graph with the use of decomposition
✍ Jacek Wojciechowski πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 1015 KB

The method of tree generation of a graph decomposed into any number of parts is described in this paper. The decomposition of a graph is dejined. Theformulafor the generation of trees of a decomposed graph is given in Theorem I. The necessary and suflcient conditions which a graph decomposition must

Generation of all possible trees of a gr
Generation of all possible trees of a graph in independent groups
✍ R. Hashemian; M.S. Bakhtiar πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 268 KB

A special graph, the PS graph, is introduced and an algorithm is developed to generate all trees of such graphs. It is proved that for any given graph, G there exists certain number of PS graphs, obtained from G, such that the collection of all trees of all such PS graph span all trees of G with no