Skip to Main Content
Combinatorics of Permutations, 2nd Edition
book

Combinatorics of Permutations, 2nd Edition

by Miklos Bona
April 2016
Intermediate to advanced content levelIntermediate to advanced
478 pages
14h 44m
English
Chapman and Hall/CRC
Content preview from Combinatorics of Permutations, 2nd Edition
How Did We Get Here? Permutations as Genome Rearrangements. 371
9.3.1.1 Variations of the Cycle Graph
The concept of cycle graphs is a very important one, and as such, it has
been introduced several times, in slightly different (but essentially equivalent)
versions. One such version identifies vertices p
0
=0andp
n+1
= n +1 so
that these two vertices become one, and leaves all the other rules unchanged,
except that i +1andi 1 are now meant modulo n. So the new vertex (let
us call it 0), now has four edges adjacent to it, namely one edge of each color
leaving it, and one edge of each color arriving at it, just like any other vertex.
This “circular” version ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Introduction to Combinatorics, 2nd Edition

Introduction to Combinatorics, 2nd Edition

Martin J. Erickson

Publisher Resources

ISBN: 9781439850527