Modular Sum-Defined Irregular Colorings

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


In the sum-defined vertex-distinguishing edge coloring described in Chap. 1, the colors are selected from sets of the type [k] = { 1, 2, , k} for an integer k ≥ 2. There is also a sum-defined vertex-distinguishing edge coloring whose colors are chosen instead from the sets \(\mathbb{Z}_{k}\) of integers modulo k for integers k ≥ 2.


Vertex-distinguishing Edge Coloring Graceful Labeling Graceful Graphs Anton Kotzig Graceful Tree Conjecture 
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.


  1. 14.
    Bondy, J. A., & Chvátal, V. (1976). A method in graph theory. Discrete Mathematics, 15, 111–136.MathSciNetCrossRefzbMATHGoogle Scholar
  2. 47.
    Gallian, J. A. (2009). A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, 16, #DS6.Google Scholar
  3. 48.
    Gnana Jothi, R. B. (1991). Topics in graph theory. Ph.D. Thesis, Madurai Kamaraj University.Google Scholar
  4. 49.
    Golomb, S. W. (1972). How to number a graph. In Graph theory and computing (pp. 23–37). New York: Academic.Google Scholar
  5. 59.
    Jones, R. (2011). Modular and graceful edge colorings of graphs. Ph.D. Dissertation, Western Michigan University.Google Scholar
  6. 60.
    Jones, R., & Zhang, P. (2012). Nowhere-zero modular edge-graceful graphs. The Discussiones Mathematicae Graph Theory, 32, 487–505.MathSciNetCrossRefzbMATHGoogle Scholar
  7. 61.
    Jones, R., Kolasinski, K., & Zhang, P. (2012). A proof of the modular edge-graceful trees conjecture. Journal of Combinatorial Mathematics and Combinatorial Computing, 80, 445–455.MathSciNetzbMATHGoogle Scholar
  8. 64.
    Jones, R., Kolasinski, K., Okamoto, F., & Zhang, P. (2013). On modular edge-graceful graphs. Graphs and Combinatorics, 29, 901–912.MathSciNetCrossRefzbMATHGoogle Scholar
  9. 75.
    Rosa, A. (1967). On certain valuations of the vertices of a graph. In Theory of Graphs, Proceedings of International Symposium, Rome 1966 (pp. 349–355). New York: Gordon and Breach.Google Scholar

Copyright information

© Ping Zhang 2015

Authors and Affiliations

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

Personalised recommendations