Seminar Paper

Paper Information

video

sound

Persian Version

View:

344

Download:

140

Cites:

Information Seminar Paper

Title

MAJORITY DOMINATION IN DIGRAPHS

Pages

  -

Abstract

 THE CONCEPT OF MAJORITY DOMINATION IN GRAPHS HAS BEEN DEFINED IN AT LEAST TWO DIFFERENT WAYS: AS A FUNCTION AND AS A SET. IN THIS WORK WE EXTEND THE LATTER CONCEPT TO DIGRAPHS, WHILE WE EXTENDED THE FORMER IN ANOTHER PAPER. GIVEN A DIGRAPH D= (V, A), A SET SÍ V IS A MAJORITY OUT-DOMINATING SET (MODS) OF D IF (FORMULA). THE MINIMUM CARDINALITY OF A MAJORITY OUT-DOMINATING SET IN D IS THE SET MAJORITY OUT-DOMINATION NUMBER ¡M+ (D) OF D. IN THIS WORK WE INTRODUCE THESE CONCEPTS AND PROVE SOME RESULTS ABOUT THEM, AMONG WHICH THE CHARACTERIZATION OF MINIMAL MODSS.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    EBADI, KARAM, Manrique, Martin, JAFARY, REZA, & Joseline Manora, J.. (2015). MAJORITY DOMINATION IN DIGRAPHS. ANNUAL IRANIAN MATHEMATICS CONFERENCE. SID. https://sid.ir/paper/920761/en

    Vancouver: Copy

    EBADI KARAM, Manrique Martin, JAFARY REZA, Joseline Manora J.. MAJORITY DOMINATION IN DIGRAPHS. 2015. Available from: https://sid.ir/paper/920761/en

    IEEE: Copy

    KARAM EBADI, Martin Manrique, REZA JAFARY, and J. Joseline Manora, “MAJORITY DOMINATION IN DIGRAPHS,” presented at the ANNUAL IRANIAN MATHEMATICS CONFERENCE. 2015, [Online]. Available: https://sid.ir/paper/920761/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops