مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

181
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

71
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

Zk-Magic Labeling of Some Families of Graphs

Pages

  1-12

Abstract

 For any non-trivial abelian group A under addition a graph G is said to be A-magic if there exists a labeling f: E(G) → A − {0} such that, the vertex labeling f+ defined as f+(v) = P f(uv) taken over all edges uv incident at v is a constant. An A-magic graph G is said to be Zk-magic graph if the group A is Zk the group of integers modulo k. These Zk-magic graphs are referred to as k-magic graphs. In this paper we prove that the total graph, flower graph, generalized prism graph, closed helm graph, lotus inside a circle graph, G ⊙; Km, m-splitting graph of a path and m-shadow graph of a path are Zk-magic graphs.

Multimedia

  • No record.

    • Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    Jeyanthi, p., & Jeya Daisy, k.. (2018). Zk-Magic Labeling of Some Families of Graphs. JOURNAL OF ALGORITHMS AND COMPUTATION, 50(2), 1-12. SID. https://sid.ir/paper/354564/en

    Vancouver: Copy

    Jeyanthi p., Jeya Daisy k.. Zk-Magic Labeling of Some Families of Graphs. JOURNAL OF ALGORITHMS AND COMPUTATION[Internet]. 2018;50(2):1-12. Available from: https://sid.ir/paper/354564/en

    IEEE: Copy

    p. Jeyanthi, and k. Jeya Daisy, “Zk-Magic Labeling of Some Families of Graphs,” JOURNAL OF ALGORITHMS AND COMPUTATION, vol. 50, no. 2, pp. 1–12, 2018, [Online]. Available: https://sid.ir/paper/354564/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button