A Note on Neighbor Expanded Sum Distinguishing Index

• Autorzy: Evelyne Flandrin , Hao Li , Antoni Marczyk , Jean-François Saclé , Mariusz Woźniak
• Języki publikacji: EN

Abstrakty

EN

A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set [k] = {1, . . . , k}. These colors can be used to distinguish the vertices of G. There are many possibilities of such a distinction. In this paper, we consider the sum of colors on incident edges and adjacent vertices.

Słowa kluczowe

EN

general edge coloring; total coloring; neighbor-distinguishing index; neighbor sum distinguishing coloring

Kategorie tematyczne

• 05C15: Coloring of graphs and hypergraphs

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 1
• Strony: 29-37

Daty

wydano

2017-02-01

otrzymano

2015-06-26

poprawiono

2016-02-01

zaakceptowano

2016-02-01

online

2017-01-13

Twórcy

autor

Evelyne Flandrin

• LRI, UMR 8623, Université de Paris-Sud, Bât. 650, rue Noetzlin, Gif-sur-Yvette,

autor

Hao Li

• LRI, UMR 8623, Université de Paris-Sud, Bât. 650, rue Noetzlin, Gif-sur-Yvette,

autor

Antoni Marczyk

• AGH University, Department of Discrete Mathematics, Al. Mickiewicza 30, 30–059 Kraków,

autor

Jean-François Saclé

• LRI, UMR 8623, Université de Paris-Sud, Bât. 650, rue Noetzlin, Gif-sur-Yvette,

autor

Mariusz Woźniak

• AGH University, Department of Discrete Mathematics, Al. Mickiewicza 30, 30–059 Kraków,

Identyfikatory

DOI

10.7151/dmgt.1909