Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle

Laura Frigerio; Federico Lastaria; Norma Zagaglia Salvi

Discussiones Mathematicae Graph Theory (2011)

  • Volume: 31, Issue: 3, page 547-557
  • ISSN: 2083-5892

Abstract

top
In this paper we investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph G in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct product of G by a path or a cycle.

How to cite

top

Laura Frigerio, Federico Lastaria, and Norma Zagaglia Salvi. "Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle." Discussiones Mathematicae Graph Theory 31.3 (2011): 547-557. <http://eudml.org/doc/271048>.

@article{LauraFrigerio2011,
abstract = {In this paper we investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph G in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct product of G by a path or a cycle.},
author = {Laura Frigerio, Federico Lastaria, Norma Zagaglia Salvi},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {chromatic index; adjacent vertex distinguishing edge coloring; direct product; matching},
language = {eng},
number = {3},
pages = {547-557},
title = {Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle},
url = {http://eudml.org/doc/271048},
volume = {31},
year = {2011},
}

TY - JOUR
AU - Laura Frigerio
AU - Federico Lastaria
AU - Norma Zagaglia Salvi
TI - Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle
JO - Discussiones Mathematicae Graph Theory
PY - 2011
VL - 31
IS - 3
SP - 547
EP - 557
AB - In this paper we investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph G in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct product of G by a path or a cycle.
LA - eng
KW - chromatic index; adjacent vertex distinguishing edge coloring; direct product; matching
UR - http://eudml.org/doc/271048
ER -

References

top
  1. [1] P.N. Balister, E. Györi, J. Lehel and R.H. Schelp, Adjacent vertex distinguishing edge-colorings, SIAM J. Discrete Math. 21 (2007) 237-250, doi: 10.1137/S0895480102414107. Zbl1189.05056
  2. [2] J.L. Baril, H. Kheddouci and O. Togni, Adjacent vertex distinguishing edge-colorings of meshes, Australasian J. Combin. 35 (2006) 89-102. Zbl1108.05035
  3. [3] P.K. Jha, Kronecker products of paths and cycles: decomposition, factorization and bi-pancyclicity, Discrete Math. 182 (1998) 153-167, doi: 10.1016/S0012-365X(97)00138-6. Zbl0890.05052
  4. [4] D.B. West, Introduction to Graph Theory, second ed. (Prentice Hall, Englewood Cliffs, NY, USA, 2001). 
  5. [5] Z. Zhang, L. Liu and J. Wang, Adjacent strong edge coloring of graphs, Appl. Math. Lett. 15 (2002) 623-626, doi: 10.1016/S0893-9659(02)80015-5. Zbl1008.05050

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.