Graphs and Combinatorics

, Volume 29, Issue 4, pp 901–912 | Cite as

On Modular Edge-Graceful Graphs

  • Futaba Fujie-Okamoto
  • Ryan Jones
  • Kyle Kolasinski
  • Ping Zhang
Original Paper


Let G be a connected graph of order \({n\ge 3}\) and size m and \({f:E(G)\to \mathbb{Z}_n}\) an edge labeling of G. Define a vertex labeling \({f': V(G)\to \mathbb{Z}_n}\) by \({f'(v)= \sum_{u\in N(v)}f(uv)}\) where the sum is computed in \({\mathbb{Z}_n}\) . If f′ is one-to-one, then f is called a modular edge-graceful labeling and G is a modular edge-graceful graph. A graph G is modular edge-graceful if G contains a modular edge-graceful spanning tree. Several classes of modular edge-graceful trees are determined. For a tree T of order n where \({n\not\equiv 2 \pmod 4}\) , it is shown that if T contains at most two even vertices or the set of even vertices of T induces a path, then T is modular edge-graceful. It is also shown that every tree of order n where \({n\not\equiv 2\pmod 4}\) having diameter at most 5 is modular edge-graceful.


Modular edge-graceful labeling Modular edge-graceful graph 

Mathematics Subject Classification (2000)

05C05 05C78 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chartrand G., Lesniak L., Zhang P.: Graphs and Digraphs, 5th edn. CRC Press, Boca Raton (2010)Google Scholar
  2. 2.
    Gallian J.A.: A dynamic survey of graph labeling. Electron. J. Combin. 16, #DS6 (2009)Google Scholar
  3. 3.
    Golomb, S.W.: How to number a graph. In: Graph Theory and Computing, pp. 23–37. Academic Press, New York (1972)Google Scholar
  4. 4.
    Jones R., Kolasinski K., Okamoto F., Zhang P.: Modular neighbor-distinguishing edge colorings of graphs. J. Combin. Math. Combin. Comput. 76, 159–175 (2011)MathSciNetMATHGoogle Scholar
  5. 5.
    Jothi, R.B.G.: Topics in graph theory. Ph.d. thesis, Madurai Kamaraj University (1991)Google Scholar
  6. 6.
    Lee S.M.: A conjecture on edge-graceful trees. Sci. Ser. A Math. Sci. 3, 45–57 (1989)MathSciNetMATHGoogle Scholar
  7. 7.
    Lo S.P.: On edge-graceful labelings of graphs. Congr. Numer. 50, 231–241 (1985)MathSciNetGoogle Scholar
  8. 8.
    Okamoto F., Salehi E., Zhang P.: A checkerboard problem and modular colorings of graphs. Bull. Inst. Combin. Appl. 58, 29–47 (2010)MathSciNetMATHGoogle Scholar
  9. 9.
    Okamoto F., Salehi E., Zhang P.: A solution to the checkerboard problem. Intern. J. Comput. Appl. Math. 5, 447–458 (2010)MathSciNetGoogle Scholar
  10. 10.
    Rosa, A.: On certain valuations of the vertices of a graph. In: Theory of Graphs, Pro. Internat. Sympos. Rome 1966, pp. 349–355. Gordon and Breach, New York (1967)Google Scholar

Copyright information

© Springer 2012

Authors and Affiliations

  • Futaba Fujie-Okamoto
    • 1
  • Ryan Jones
    • 2
  • Kyle Kolasinski
    • 2
  • Ping Zhang
    • 2
  1. 1.Mathematics DepartmentUniversity of Wisconsin La CrosseLa CrosseUSA
  2. 2.Department of MathematicsWestern Michigan UniversityKalamazooUSA

Personalised recommendations