𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Enumerating the Trees of the Wheel and Other Special Graphs

✍ Scribed by David E. Johnson; Johnny R. Johnson

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
479 KB
Volume
315
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis

A specialized method is presented for listing all the spanning trees of the wheel, homeomorphs of the wheel, and certain cellular arrays. The procedure is a generalization of a known method of enumerating the trees of a suitably labeled ladder graph, and results in a direct listing of the trees with no duplications and no extraneous subgraphs.

πŸ“œ SIMILAR VOLUMES

On the domination of the products of gra
On the domination of the products of graphs II: Trees
✍ Michael S. Jacobson; Lael F. Kinch πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 377 KB

For a graph G, a subset of vertices D is a dominating set if for each vertex x not in D, x is adjacent to at least one vertex of D. The domination number, y(G), is the order of the smallest such set. An outstanding conjecture in the theory of domination is for any two graph G and H,

On the interval number of special graphs
On the interval number of special graphs
✍ JΓ³zsef Balogh; Pascal Ochem; AndrΓ‘s PluhΓ‘r πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract The interval number of a graph __G__ is the least natural number __t__ such that __G__ is the intersection graph of sets, each of which is the union of at most __t__ intervals, denoted by __i__(__G__). Griggs and West showed that $i(G)\le \lceil {1\over 2} (d+1)\rceil $. We describe the