مرکز اطلاعات علمی 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:

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

Download:

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

Cites:

Information Journal Paper

Title

BALANCED DEGREE-MAGIC LABELINGS OF COMPLETE BIPARTITE GRAPHS UNDER BINARY OPERATIONS

Pages

  1-13

Abstract

 A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E (G) | such that the sum of the labels of the edges incident with any vertex v is equal to (1+|E (G) |) deg (v) /2.Degree-magic graphs extend supermagic regular graphs. In this paper we find the necessary and sufficient conditions for the existence of balanced degree-magic labelings of graphs obtained by taking the join, composition, Cartesian product, tensor product and strong product of COMPLETE BIPARTITE GRAPHS.

Cites

  • No record.

    • References

    Cite

    APA: Copy

    INPOONJAI, PHAISATCHA, & JIARASUKSAKUN, THIRADET. (2018). BALANCED DEGREE-MAGIC LABELINGS OF COMPLETE BIPARTITE GRAPHS UNDER BINARY OPERATIONS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), 13(2), 1-13. SID. https://sid.ir/paper/310478/en

    Vancouver: Copy

    INPOONJAI PHAISATCHA, JIARASUKSAKUN THIRADET. BALANCED DEGREE-MAGIC LABELINGS OF COMPLETE BIPARTITE GRAPHS UNDER BINARY OPERATIONS. IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI)[Internet]. 2018;13(2):1-13. Available from: https://sid.ir/paper/310478/en

    IEEE: Copy

    PHAISATCHA INPOONJAI, and THIRADET JIARASUKSAKUN, “BALANCED DEGREE-MAGIC LABELINGS OF COMPLETE BIPARTITE GRAPHS UNDER BINARY OPERATIONS,” IRANIAN JOURNAL OF MATHEMATICAL SCIENCES AND INFORMATICS (IJMSI), vol. 13, no. 2, pp. 1–13, 2018, [Online]. Available: https://sid.ir/paper/310478/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