Skip to main content
SpringerLink
Log in

On the Automorphic Chromatic Index of a Graph

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper we define the automorphic H-chromatic index of a graph Γ as the minimum integer m for which Γ has a proper edge-coloring with m colors which is preserved by a given automorphism group H of Γ. After the description of some properties, we determine upper bounds for this index when H is a cyclic group of prime order. We also show that these upper bounds are best possible in a number of instances.

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. Albertson, M.O., Collins, K.L.: Symmetry breaking in graphs. Electron. J. Combin. 3, #R18 (1996)

  2. Baumann U., Lesch M.: Transitive groups of partition preserving automorphisms of graphs with edge colourings. Wiss. Z. Tech. Hochsch. Ilmenau 34(2), 33–38 (1988)

    MATH  MathSciNet  Google Scholar 

  3. Baumann U., Lesch M., Schmeichel I.: Farb-und zerlegungstreue Automorphismen von Graphen. Math. Nachr. 134, 161–167 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  4. Baumann U., Lesch M., Schmeichel I.: Remarkable groups of graphs with edge colorings. Math. Nachr. 148, 175–182 (1990)

    MATH  MathSciNet  Google Scholar 

  5. Cameron, P.J.: Automorphism groups of graphs. In: Selected Topics in Graph Theory 2, pp. 89–127. Academic Press, London (1983)

  6. Cameron P.J., Korchmaros G.: One-factorizations of the complete graphs with a doubly transitive automorphism group. Bull. Lond. Math. Soc. 25, 1–6 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chvàtal V., Sichler J.: Chromatic automorphisms of graphs. J. Combin. Theory Ser. B 14, 209–215 (1973)

    Article  MATH  Google Scholar 

  8. Collins, K.L., Trenk, A.N.: The distinguishing chromatic number. Electron. J. Combin. 13, #R16 (2006)

  9. Giudici, M., Li, C.H.: On finite edge-primitive and edge-quasiprimitive graphs. J. Combin. Theory B. doi:10.1016/j.jctb.2009.09.00.1

  10. Harary F.: Methods of destroying the symmetries of a graph. Bull. Malays. Math. Sci. Soc. 24(2), 183–191 (2001)

    MATH  MathSciNet  Google Scholar 

  11. Harary F.: The automorphism group of a hypercube. J. UCS 6(1), 136–138 (2000)

    MATH  MathSciNet  Google Scholar 

  12. Schmeichel, I.: Automorphismen von Graphen mit zulässiger Kantenfärbung \({\phi}\). In: 2nd Colloquium for Geometry and Combinatorics, Part 1, vol. 2, pp. 244–246 (1983)

  13. West D.: Introduction to Graph Theory. Prentice Hall, Inc., Upper Saddle River (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Università di Modena e Reggio Emilia, via Campi 213/B, 41125, Modena, Italy

    Carla Fiori, Giuseppe Mazzuoccolo & Beatrice Ruini

Authors
  1. Carla Fiori
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe Mazzuoccolo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Beatrice Ruini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giuseppe Mazzuoccolo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fiori, C., Mazzuoccolo, G. & Ruini, B. On the Automorphic Chromatic Index of a Graph. Graphs and Combinatorics 26, 685–694 (2010). https://doi.org/10.1007/s00373-010-0923-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-010-0923-z

Keywords

Mathematics Subject Classification (2000)

Search

Navigation