𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The enumeration of labeled graphs by number of cutpoints

✍ Scribed by S.M. Selkow

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
351 KB
Volume
185
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Enumeration of finite field labels on gr
Enumeration of finite field labels on graphs
✍ Hirobumi Mizuno; Iwao Sato πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 276 KB

Let G be a graph, let R be a finite field and F a subgroup of the automorphism group Aut G of G. For a labeling of the vertices of G with elements of R, we consider labelings of the edges of G with elements of R such that the label on each edge is equal to the sum of labels on the two incident verti

Number of labeled 4-regular graphs
Number of labeled 4-regular graphs
✍ R. C. Read; N. C. Wormald πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 305 KB

## Abstract Several operations on 4‐regular graphs and pseudographs are analyzed and equations are obtained relating the numbers of these graphs on given numbers of labeled points. These equations are used recursively to find the numbers of 4‐regular graphs on up to 13 labeled points.

The number of labeled graphs placeable b
The number of labeled graphs placeable by a given permutation
✍ Hasunuma, Toru; Shibata, Yukio πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 370 KB πŸ‘ 2 views

Let S be a finite set and u a permutation on S. The permutation u\* on the set of 2-subsets of S is naturally induced by u. Suppose G is a graph and V(G), €(G) are the vertex set, the edge set, respectively. Let V(G) = S. If €(G) and u\*(€(G)), the image of €(G) by u\*, have no common element, then