IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i1d10.1007_s10878-018-0370-y.html
   My bibliography  Save this article

Efficient closed domination in digraph products

Author

Listed:
  • Iztok Peterin

    (University of Maribor)

  • Ismael G. Yero

    (Universidad de Cádiz)

Abstract

A digraph D is an efficient closed domination digraph if there exists a subset S of V(D) for which the closed out-neighborhoods centered in vertices of S form a partition of V(D). In this work we deal with efficient closed domination digraphs among several product of digraphs. We completely describe the efficient closed domination digraphs among lexicographic and strong products of digraphs. We characterize those direct products of digraphs that are efficient closed domination digraphs, where factors are either two cycles or two paths. Among Cartesian product of digraphs, we describe all such efficient closed domination digraphs such that they are a Cartesian product digraph either with a cycle or with a star.

Suggested Citation

  • Iztok Peterin & Ismael G. Yero, 2019. "Efficient closed domination in digraph products," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 130-149, July.
    • Handle: RePEc:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-018-0370-y
    DOI: 10.1007/s10878-018-0370-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0370-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-018-0370-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dragana Božović & Iztok Peterin, 2020. "Efficient Open Domination in Digraph Products," Mathematics, MDPI, vol. 8(4), pages 1-14, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-018-0370-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.