video

sound

Persian Version

View:

9,504

Download:

8,013

Cites:

Information Journal Paper

Title

Independent domination in directed graphs

Pages

  67-80

Abstract

 In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, trees, DAGs, cycles, and bipartite graphs. We also provide the idomatic number for special cases of some of these families of digraphs.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    Cary, Michael, Cary, Jonathan, & Prabhu, Savari. (2021). Independent domination in directed graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 6(1), 67-80. SID. https://sid.ir/paper/694666/en

    Vancouver: Copy

    Cary Michael, Cary Jonathan, Prabhu Savari. Independent domination in directed graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION[Internet]. 2021;6(1):67-80. Available from: https://sid.ir/paper/694666/en

    IEEE: Copy

    Michael Cary, Jonathan Cary, and Savari Prabhu, “Independent domination in directed graphs,” COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, vol. 6, no. 1, pp. 67–80, 2021, [Online]. Available: https://sid.ir/paper/694666/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops