video

sound

Persian Version

View:

14,494

Download:

15,025

Cites:

Information Journal Paper

Title

MAPLE PROCEDURE FOR CALCULATE OF DOMINATING SET

Author(s)

 MATINFAR M. | MIRZAMANI S.

Pages

  43-45

Abstract

 Let G is n− vertex graph. In 1996, Reed conjectured that g (G) £ [n/3] for every connected 3− regular G. In this paper, we introduce an algorithm in computer algebra system of MAPLE such that, by using any graph as input, we can calculate domination number g(G) and illustrated set of all dominating sets. It important that these sets choose among between (n g(G)) sets.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    MATINFAR, M., & MIRZAMANI, S.. (2008). MAPLE PROCEDURE FOR CALCULATE OF DOMINATING SET. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 5(19), 43-45. SID. https://sid.ir/paper/556606/en

    Vancouver: Copy

    MATINFAR M., MIRZAMANI S.. MAPLE PROCEDURE FOR CALCULATE OF DOMINATING SET. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2008;5(19):43-45. Available from: https://sid.ir/paper/556606/en

    IEEE: Copy

    M. MATINFAR, and S. MIRZAMANI, “MAPLE PROCEDURE FOR CALCULATE OF DOMINATING SET,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 5, no. 19, pp. 43–45, 2008, [Online]. Available: https://sid.ir/paper/556606/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops