On types of growth for graph-different permutations
✍ Scribed by János Körner; Gábor Simonyi; Blerina Sinaimeri
- Book ID
- 108167261
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 191 KB
- Volume
- 116
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
## 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