✦ LIBER ✦

On natural isomorphisms of cycle permutation graphs

✍ Scribed by Sam Stueckle

Publisher: Springer Japan
Year: 1988
Tongue: English
Weight: 518 KB
Volume: 4
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01864155

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Natural Isomorphism Classes of Cycle Per

Natural Isomorphism Classes of Cycle Permutation Graphs Over a Graph

✍ Hye Kyung Kim; Jin Hwan Kim; Daekeun Lim 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 134 KB

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 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

On the cycle-isomorphism of graphs

✍ Xingxing Yu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

## Abstract This paper considers conditions ensuring that cycle‐isomorphic graphs are isomorphic. Graphs of connectivity ⩾ 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs __G__ of connectivity 1 such that every graph that is cycle‐isomorphic to __G__ is also isomor

On 4-isomorphisms of graphs

✍ G Lassmann 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 126 KB

On Isomorphisms of Finite Cayley Graphs

✍ M. Conder; C. Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) ∼ = Cay(G, T ), there exists an automorphism σ of G such that S σ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m a