𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The connectivity of the SEE-graph and AEE-graph for the connected spanning k-edge subgraphs of a graph

✍ Scribed by Xueliang Li

Book ID
108316148
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
447 KB
Volume
183
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On partitioning the edges of graphs into
On partitioning the edges of graphs into connected subgraphs
✍ M. JΓΌnger; G. Reinelt; W. R. Pulleyblank πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 559 KB

For any positive integer s, an s-partition of a graph G = ( ! -( €I is a partition of E into El U E2 U U E k, where 14 = s for 1 I i 5 k -1 and 1 5 1 4 1 5 s and each €; induces a connected subgraph of G. We prove (i) if G is connected, then there exists a 2-partition, but not neces-(ii) if G is 2-e

The number of connected sparsely edged g
The number of connected sparsely edged graphs
✍ E. M. Wright πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^nβˆ’2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp