Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs

Résumé

A k-proper edge-coloring of a graph G is called adjacent vertex-distinguishing if any two adjacent vertices are distinguished by the set of colors appearing in the edges incident to each vertex. The smallest value k for which G admits such coloring is denoted by χ a (G). We prove that χ a (G) = 2R + 1 for most circulant graphs C n ([[1, R]]).
Fichier non déposé

Dates et versions

hal-02502064 , version 1 (08-03-2020)

Identifiants

  • HAL Id : hal-02502064 , version 1

Citer

Sylvain Gravier, Hippolyte Signargout, Souad Slimani. Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs. 2020. ⟨hal-02502064⟩
114 Consultations
42 Téléchargements

Partager

Gmail Facebook X LinkedIn More