Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647846 | Discrete Mathematics | 2012 | 8 Pages |
Abstract
An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the graph either by their own colors or by the colors of their neighbors. In algebraic graph theory, graphs with a certain amount of symmetry can sometimes be specified in terms of a group and a smaller graph called a voltage graph. In Radcliffe and Zhang (2007) [3], Radcliffe and Zhang found a bound for the irregular chromatic number of a graph on nn vertices. In this paper we use voltage graphs to construct graphs achieving that bound.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mark Anderson, Richard P. Vitray, Jay Yellen,