Skip to main content
SpringerLink
Log in

On the classification and toughness of generalized permutation star-graphs

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

We use an algebraic method to classify the generalized permutation star-graphs, and we use the classification to determine the toughness of all generalized permutation star-graphs.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chao, C.Y.: On groups and graphs. Trans. Amer. Math. Soc. 118 (1965), 488–497.

    Google Scholar 

  2. Chao, C.Y.: On the classification of symmetric graphs with a prime number of vertices. Trans. Amer. Math. Soc. 158 (1971), 247–257.

    Google Scholar 

  3. Chartrand, G. and Harary, F.: Planar permutation graphs. Ann. Inst. Henri Poincaré III 4 (1967), 433–438.

    Google Scholar 

  4. Chvátal, V.: Toughness graphs and Hamiltonian circuits. Discrete Math 5 (1973), 215–228.

    Google Scholar 

  5. Dörfler, W.: Automorphisms and Isomorphisms of Permutation Graphs. Colloques Inter., C.N.R.S., Problemes Combinatorics et Theorie des Graphs. vol. 260, 1978, pp. 109–110.

    Google Scholar 

  6. Dörfler, W.: On mapping graphs and permutation graphs. Math. Slovaca 3. 28 (1978), 277–288.

    Google Scholar 

  7. Frucht, R.: Die Gruppe des Petersenschen Graphen und der Kantensysteme der regulären Polyeder. Commentarii Mathematici Helvetici 9 (1938), 217–223.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  10. Stueckle, S.: On natural isomorphims of cycle permutation graphs. Graphs and Combinatorics 4 (1988), 75–85.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Pittsburgh, Pittsburgh, PA, 15260, USA

    Chong-Yun Chao & Shao-cen Han

Authors
  1. Chong-Yun Chao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shao-cen Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chao, CY., Han, Sc. On the classification and toughness of generalized permutation star-graphs. Czechoslovak Mathematical Journal 47, 431–452 (1997). https://doi.org/10.1023/A:1022455216281

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022455216281

Keywords

Search

Navigation