✦ LIBER ✦

Generation of all possible trees of a graph in independent groups

✍ Scribed by R. Hashemian; M.S. Bakhtiar

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 268 KB
Volume: 7
Category: Article
ISSN: 0010-4485
DOI: 10.1016/0010-4485(75)90004-4

No coin nor oath required. For personal study only.

✦ Synopsis

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 duplication. In addition to a number of properties of PS graphs indicated, the procedure seems very useful for topological analysis and design of networks, or any other types of systems that can be represented by a linear graph.

📜 SIMILAR VOLUMES

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

Generalizations of independence and chro

Generalizations of independence and chromatic numbers of a graph

✍ E. Sampathkumar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Sampathkumar, E., Generalizations of independence and chromatic numbers of a graph, Discrete Mathematics 115 (1993) 2455251. Let G = (V, E) be a graph and k > 2 be an integer. A set S c V is k-independent if every component in the subgraph (S) induced by S has order at most k-1. The general chromati

A generalized measure of independence an

A generalized measure of independence and the strong product of graphs

✍ B. H. Barnes; K. E. Mackey 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 583 KB

Diameter of random spanning trees in a g

Diameter of random spanning trees in a given graph

✍ Fan Chung; Paul Horn; L. Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w

Counting spanning trees in the graphs of

Counting spanning trees in the graphs of Kleitman and Golden and a generalization

✍ R. Vohra; L. Washington 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 302 KB

A new calculation is given for the number of spanning trees in a family of labellec; graphs considered by Kleitman and Golden, and for a more general class of such graphs.

On the number of spanning trees in a mol

On the number of spanning trees in a molecular graph

✍ R.B. Mallion 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 444 KB

A rccenl theorem due to W'aller is applied to the mokculnr gmph of a typical conjugtcd system (naphthalene) in order to demonstrate the enumeration of spanning trees, on each of which a "ring current" calculation may be based.