Seminar Paper

Paper Information

video

sound

Persian Version

View:

106

Download:

37

Cites:

Information Seminar Paper

Title

COUNTING γ-SETS OF CARTESIAN PRODUCT WITH COMPLETE GRAPHS

Author(s)

 ALIKHANI SAEID

Pages

  -

Abstract

 LET G= (V, E) BE A SIMPLE GRAPH. A SET S  Í V IS A DOMINATING SET IF EVERY VERTEX IN V \SIS ADJACENT TO AT LEAST ONE VERTEX IN S. THE DOMINATION NUMBER G IS THE MINIMUM CARDINALITY OF A DOMINATING SET IN G. A DOMINATING SET OF G WITH CARDINALITY G IS CALLED G-SET OF G. IN THIS PAPER, WE COUNT THE NUMBER OF G-SETS OF CARTESIAN PRODUCT OF G WITH COMPLETE GRAPHS.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    ALIKHANI, SAEID. (2016). COUNTING γ-SETS OF CARTESIAN PRODUCT WITH COMPLETE GRAPHS. ANNUAL IRANIAN MATHEMATICS CONFERENCE. SID. https://sid.ir/paper/947532/en

    Vancouver: Copy

    ALIKHANI SAEID. COUNTING γ-SETS OF CARTESIAN PRODUCT WITH COMPLETE GRAPHS. 2016. Available from: https://sid.ir/paper/947532/en

    IEEE: Copy

    SAEID ALIKHANI, “COUNTING γ-SETS OF CARTESIAN PRODUCT WITH COMPLETE GRAPHS,” presented at the ANNUAL IRANIAN MATHEMATICS CONFERENCE. 2016, [Online]. Available: https://sid.ir/paper/947532/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops