𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A transposition factorization of walk-permutations in graphs

✍ Scribed by Amitai Regev

Book ID
107885153
Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
250 KB
Volume
56
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Short factorizations of permutations int
Short factorizations of permutations into transpositions
✍ J.A. Eidswick πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 489 KB

The number of factorizations of an n-cycle into n -1 transpositions is determined under the assumption that factorizations are counted as different if and only if they cannot be commuted into one another.

Factoring, into Edge Transpositions of a
Factoring, into Edge Transpositions of a Tree, Permutations Fixing a Terminal Vertex
✍ John H. Smith πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 71 KB

If the symmetric group is generated by transpositions corresponding to the edges of a spanning tree we discuss identities they satisfy, including a set of defining relations. We further show that a minimal length factorization of a permutation fixing a terminal vertex does not involve the unique edg

A 1-factorization of the line graphs of
A 1-factorization of the line graphs of complete graphs
✍ Brian Alspach πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 254 KB πŸ‘ 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.

The number of walks in a graph
The number of walks in a graph
✍ A Dress; I Gutman πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 349 KB

The aim of this note is to call attention to a simple regularity regarding the number of walks in a finite graph G. Let wk denote the number of walks of length k(> 0) in G. Then Wi+,, 5 W&Wzb holds for all a, b E NJ while equality holds exclusively either (I) for all a, b E No (in case G is a regula