Skip to main content
SpringerLink
Log in

On the Toughness of Cycle Permutation Graphs

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

Motivated by the conjectures in [11], we introduce the maximal chains of a cycle permutation graph, and we use the properties of maximal chains to establish the upper bounds for the toughness of cycle permutation graphs. Our results confirm two conjectures in [11].

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. D. Bauer, E. Schmeichel, and H. J. Veldman: Some recent results on long cycles in tough graphs. Graph Theory, Combinatorics, and Applications–Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs (Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Schwenk, eds.). John Wiley & Sons, New York, 1991, pp. 113–121.

    Google Scholar 

  2. D. Bauer, E. Schmeichel, and H. J. Veldman: Cycles in tough graphs-updating the last four years. Graph Theory, Combinatorics, and Applications–Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs (Y. Alavi and A. J. Schwenk, eds.). Wiley & Sons, New York, 1995, pp. 19–34.

    Google Scholar 

  3. C.Y. Chao and S.C. Han: A note on the toughness of generalized Petersen graphs. J. Math. Res. Exposition 12 (1992), 183–186.

    Google Scholar 

  4. C.Y. Chao and S.C. Han: On the classification and toughness of generalized permutation star-graphs. Czechoslovak Math. J. 47 (1997), 431–452.

    Google Scholar 

  5. G. Chartrand and R. J. Wilson: The Petersen graph. Graphs and Applications (F. Harary and J. S. Maybee, eds.). John Wiley & Sons, 1982, pp. 69–99.

  6. V. Chvátal: Tough graphs and hamiltonian circuits. Math. Slovaca 28 (1979), 215–228.

    Google Scholar 

  7. W. Döfler: On mapping graphs and permutation graphs. Math. Slovaca 28 (1979), 277–288.

    Google Scholar 

  8. K. Ferland: On the toughness of some generalized Petersen graphs. Ars Combin. (1993), 65–88.

  9. W. Goddard: The toughness of cubic graphs. Graphs Combin. 12 (1996), 17–22.

    Google Scholar 

  10. D. Guichard, B. Piazza, and S. Stueckle: On the vulnerability of permutation graphs of complete and complete bipartite graphs. Ars Combin. 31 (1991), 149–157.

    Google Scholar 

  11. B. Piazza, R. Ringeisen, and S. Stueckle: On the vulnerability of cycle permutation graphs. Ars Combin. 29 (1990), 289–296.

    Google Scholar 

  12. W.T. Tutte: On the algebraic theory of graph colorings. J. Combin. Theory 1 (1960), 15–50.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Chao Chong-Yun & Shaocen Han

Authors
  1. Chao Chong-Yun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shaocen 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

Chong-Yun, C., Han, S. On the Toughness of Cycle Permutation Graphs. Czechoslovak Mathematical Journal 51, 239–260 (2001). https://doi.org/10.1023/A:1013786612087

Download citation

  • Issue Date:

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

Search

Navigation