Open AccessAdjacent vertex distinquishing edge colorings of the direct product of a regular graph by a path or cycle
Author(s) -
Laura Frigerio,
Federico G. Lastaria,
Norma Zagaglia Salvi
Publication year - 2011
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1564
Subject(s) - combinatorics , mathematics , vertex (graph theory) , direct product , graph , discrete mathematics
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom