Advertisement

Modular Sum-Defined Neighbor-Distinguishing Colorings

  • Ping Zhang
Chapter
  • 546 Downloads
Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Abstract

While Chap. 2 dealt with sum-defined vertex-distinguishing edge colorings whose colors are positive integers, Chap. 3 considered corresponding edge colorings whose colors are elements of the integers modulo k for some integer k ≥ 2.

Keywords

Edge Coloring Proper Vertex Coloring Petersen Graph Adjacent Vertices Incident Edges 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 62.
    Jones, R., Kolasinski, K., Okamoto, F., & Zhang, P. (2011). Modular neighbor-distinguishing edge colorings of graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 76, 159–175.MathSciNetzbMATHGoogle Scholar
  2. 63.
    Jones, R., Kolasinski, K., Okamoto, F., & Zhang, P. (2012). On modular chromatic indexes of graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 82, 295–306.MathSciNetzbMATHGoogle Scholar

Copyright information

© Ping Zhang 2015

Authors and Affiliations

  • Ping Zhang
    • 1
  1. 1.Department of MathematicsWestern Michigan UniversityKalamazooUSA

Personalised recommendations