๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The exponential generating function of labelled blocks

โœ Scribed by N. Wormald; E.M. Wright

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
320 KB
Volume
25
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

An (n, 9) graph is a graph on n points and 9 edges (no loops, no parallel lines); except where we state otherwise, the n points are labelled. A network is a graph in which two points are distinguished as a positive pole and a negative pole respectively. A block is a 2-connected graph (i,e. a graph from which at least 2 points and their adjacent edges have to be removed to disconnect the graph) or a maximal 2-connected sub-graph of a graph which is nhot itself 2-connected; conventionally the (2,1) graph is a block and the (1,O) graph is not. We write fV=$(n -1) and b(n, q) is the number of (n, q) blocks. If

๐Ÿ“œ SIMILAR VOLUMES

The generating function of Whitworth run
The generating function of Whitworth runs
โœ C.J. Liu ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 715 KB

Let G be a graph. The number of ways of selecting k vertices in G such that the subgraph induced by the k selected vertices containing 1 edges may be considered as Whitworth runs. For two arbitrary graphs Gr and G2 we show that the generating function of G1 can be written as a sum of the generating