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

On the automorphic chromatic index of a graph

Mazzuoccolo, Giuseppe;
2010-01-01

Abstract

In this paper we define the automorphic H-chromatic index of agraph G as the minimum integer m for which G has aproper edge-coloring with m colors which is preserved by a given automorphism group H of G. After the description of some properties, we determine upper bounds for this indexwhen H is a cyclic group of prime order. We also show that these upper bounds are best possible in a number of istances.
graph; edge-coloring; automorphism
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/927906
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 2
social impact