Local Antimagic Vertex Coloring of a Graph

被引：86

作者：

Arumugam, S. ^{[1
,2
,3
]}

Premalatha, K. ^{[1
]}

Baa, Martin ^{[4
]}

Semanicova-Fenovcikova, Andrea ^{[4
]}

机构：

[1] Kalasalingam Univ, Natl Ctr Adv Res Discrete Math, Krishnankoil 626126, Tamil Nadu, India

[2] Liverpool Hope Univ, Dept Comp Sci, Liverpool, Merseyside, England

[3] Ball State Univ, Dept Comp Sci, Muncie, IN 47306 USA

[4] Tech Univ, Dept Appl Math & Informat, Kosice, Slovakia

来源：

GRAPHS AND COMBINATORICS | 2017年 / 33卷 / 02期

关键词：

Antimagic labeling; Local antimagic labeling; Local antimagic chromatic number;

D O I：

10.1007/s00373-017-1758-7

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let be a connected graph with and A bijection is called a local antimagic labeling if for any two adjacent vertices u and v, where and E(u) is the set of edges incident to u. Thus any local antimagic labeling induces a proper vertex coloring of G where the vertex v is assigned the color w(v). The local antimagic chromatic number is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper we present several basic results on this new parameter.

引用

页码：275 / 285

页数：11