𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Toughness of Cycle Permutation Graphs

✍ Scribed by Chao Chong-Yun; Shaocen Han

Book ID
110324142
Publisher
Springer
Year
2001
Tongue
English
Weight
218 KB
Volume
51
Category
Article
ISSN
0011-4642

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Isomorphism classes of cycle permutation
Isomorphism classes of cycle permutation graphs
✍ Jin Ho Kwak; Jaeun Lee πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 769 KB

In this paper, we construct a cycle permutation graph as a covering graph over the dumbbell graph, and give a new characterization of when two given cycle permutation graphs are isomorphic by a positive or a negative natural isomorphism. Also, we count the isomorphism classes of cycle permutation gr

On diameter of permutation graphs
On diameter of permutation graphs
✍ Gu, Weizhen πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 2 views

Let G be a connected graph with n vertices. Let a be a permutation in S n . The a-generalized graph over G, denoted by P a (G), consists of two disjoint, identical copies of G along with edges Β£a(Β£). In this paper, we investigated the relation between diameter of P a (G) and diameter of G for any pe

On testing isomorphism of permutation gr
On testing isomorphism of permutation graphs
✍ Charles J. Colbourn πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 530 KB

## Abstract A polynomial time algorithm for testing isomorphism of permutation graphs (comparability graphs of 2‐dimensional partial orders) is described. It operates by performing two types of simplifying transformations on the graph; the contraction of duplicate vertices and the contraction of un