IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i2d10.1007_s10878-019-00481-3.html
   My bibliography  Save this article

Domination and matching in power and generalized power hypergraphs

Author

Listed:
  • Yanxia Dong

    (Shanghai University of International Business and Economics)

  • Moo Young Sohn

    (Mathematics, Changwon National University)

  • Zuosong Liang

    (Qufu Normal University)

Abstract

Let D be a subset of vertices of a hypergraph $${\mathcal {H}}$$H. D is called a dominating set of $${\mathcal {H}}$$H if for every $$v\in V{\setminus } D$$v∈V\D there exists $$u\in D$$u∈D such that u and v lie in an hyperedge of $${\mathcal {H}}$$H. The cardinality of a minimum dominating set of $${\mathcal {H}}$$H is called the domination number of $${\mathcal {H}}$$H, denoted by $$\gamma ({\mathcal {H}})$$γ(H). A matching in a hypergraph $${\mathcal {H}}$$H is a set of pairwise disjoint hyperedges. The matching number $$\nu ({\mathcal {H}})$$ν(H) of $${\mathcal {H}}$$H is the size of a maximum matching in $${\mathcal {H}}$$H. It is known that $$\gamma ({\mathcal {H}})\le (r-1)\nu ({\mathcal {H}})$$γ(H)≤(r-1)ν(H) for any r-uniform hypergraph $${\mathcal {H}}$$H. In this paper we investigate the relation between the domination number and matching number for some special hypergraphs. First, we prove that every power hypergraph H of rank r satisfies the inequality $$\nu (H)\le \gamma (H)\le 2\nu (H)$$ν(H)≤γ(H)≤2ν(H), and we provide the complete characterizations of the power hypergraph H of rank r with $$\gamma (H)=\nu (H)$$γ(H)=ν(H) and $$\gamma (H)=2\nu (H)$$γ(H)=2ν(H). Then we extend the corresponding results to generalized power hypergraphs. For any generalized power hypergraph $$H^{k,s}$$Hk,s, we present $$\nu (H^{k,s})\le \gamma (H^{k,s})\le 2\nu (H^{k,s})$$ν(Hk,s)≤γ(Hk,s)≤2ν(Hk,s) for $$1\le s

Suggested Citation

  • Yanxia Dong & Moo Young Sohn & Zuosong Liang, 2020. "Domination and matching in power and generalized power hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 39(2), pages 425-436, February.
  • Handle: RePEc:spr:jcomop:v:39:y:2020:i:2:d:10.1007_s10878-019-00481-3
    DOI: 10.1007/s10878-019-00481-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00481-3
    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-019-00481-3?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.

    References listed on IDEAS

    as
    1. Liying Kang & Shan Li & Yanxia Dong & Erfang Shan, 2017. "Matching and domination numbers in r-uniform hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 656-659, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Liying Kang & Wei Zhang & Erfang Shan, 0. "The spectral radius and domination number in linear uniform hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-12.
    2. Liying Kang & Wei Zhang & Erfang Shan, 2021. "The spectral radius and domination number in linear uniform hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 42(3), pages 581-592, October.

    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:39:y:2020:i:2:d:10.1007_s10878-019-00481-3. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.