Skip to main content
Log in

On natural isomorphisms of cycle permutation graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Two problems are approached in this paper. Given a permutation onn elements, which permutations onn elements yield cycle permutation graphs isomorphic to the cycle permutation graph yielded by the given permutation? And, given two cycle permutation graphs, are they isomorphic? Here the author deals only with natural isomorphisms, those isomorphisms which map the outer and inner cycles of one cycle permutation graph to the outer and inner cycles of another cycle permutation graph.

A theorem is stated which then allows the construction of the set of permutations which yield cycle permutation graphs isomorphic to a given cycle permutation graph by a natural isomorphism. Another theorem is presented which finds the number of such permutations through the use of groups of symmetry of certain drawings of cycles in the plane. These drawings are also used to determine whether two given cycle permutation graphs are isomorphic by a natural isomorphism.

These two methods are then illustrated by using them to solve the first problem, restricted to natural isomorphism, for a certain class of cycle permutation graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Behzad, M., Chartrand, G., Lesniak-Foster, L.: Graphs and Digraphs. Boston: Wadsworth 1979

    Google Scholar 

  2. Chartrand, G., Harary, F.: Planar permutation graphs. Ann. Inst. Henri Poincare III4, 433–438 (1967)

    Google Scholar 

  3. Dorfler, W.: Automorphisms and Isomorphisms of Permutation Graphs. Colloques Inter., C.N.R.S., Problemes Combinatorics et Theorie des Graphes260, 109–110 (1978)

    Google Scholar 

  4. Dorfler, W.: On mapping graphs and permutation graphs. Math. Slovaca 3.28, 277–288 (1978)

    Google Scholar 

  5. Frame, J.S.: On the decomposition of transitive permutation groups generated by the symmetric group. Proc. Natl. Acad. Sci.26, 132–139 (1940)

    Google Scholar 

  6. Frame, J.S.: The double cosets of a finite group, Bull. Amer. Math. Soc.47, 458–467 (1941)

    Google Scholar 

  7. Hedetniemi, S.: On classes of graphs defined by special cutsets of lines. In: The Many Facets of Graph Theory. Lecture Notes in Mathematics 110, pp. 171–190. Berlin: Springer-Verlag 1969

    Google Scholar 

  8. Holton, D.A., Stacey, K.C.: Some problems in permutation graphs. In: Combinatorial Mathematics III. Lecture Notes in Mathematics 452, pp. 143–155. Berlin: Springer-Verlag 1975

    Google Scholar 

  9. Ringeisen, R.: On cycle permutation graphs. Discrete Math.51, 265–275 (1984)

    Google Scholar 

  10. Stueckle, S.: Symmetries of certain drawings of cycles. Congressus Numerantium (to appear)

  11. Stueckle, S.: Algebraic and isomorphism properties of cycle permutation graphs. Ph.D. Thesis, Clemson University, South Carolina 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stueckle, S. On natural isomorphisms of cycle permutation graphs. Graphs and Combinatorics 4, 75–85 (1988). https://doi.org/10.1007/BF01864155

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01864155

Keywords

Navigation