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

The spectral radius and domination number in linear uniform hypergraphs

Author

Listed:
  • Liying Kang

    (Shanghai University)

  • Wei Zhang

    (National University of Singapore)

  • Erfang Shan

    (Shanghai University)

Abstract

This paper investigates the spectral radius and signless Laplacian spectral radius of linear uniform hypergraphs. A dominating set in a hypergraph H is a subset D of vertices if for every vertex v not in D there exists $$u\in D$$ u ∈ D such that u and v are contained in a hyperedge of H. The minimum cardinality of a dominating set of H is called the domination number of H. We present lower bounds on the spectral radius and signless Laplacian spectral radius of a linear uniform hypergraph in terms of its domination number.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:42:y:2021:i:3:d:10.1007_s10878-019-00424-y
    DOI: 10.1007/s10878-019-00424-y
    as

    Download full text from publisher

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

    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.
    2. Shenglong Hu & Liqun Qi, 2015. "The Laplacian of a uniform hypergraph," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 331-366, February.
    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. Alla Kammerdiner & Alexander Veremyev & Eduardo Pasiliao, 2017. "On Laplacian spectra of parametric families of closely connected networks with application to cooperative control," Journal of Global Optimization, Springer, vol. 67(1), pages 187-205, January.
    3. Honghai Li & Jia-Yu Shao & Liqun Qi, 2016. "The extremal spectral radii of $$k$$ k -uniform supertrees," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 741-764, October.
    4. G. H. Shirdel & A. Mortezaee & E. Golpar-raboky, 2021. "$${\mathcal {C}}^k_{m,s}$$ C m , s k as a k-uniform hypergraph and some its properties," Indian Journal of Pure and Applied Mathematics, Springer, vol. 52(1), pages 297-303, March.
    5. Hongying Lin & Bo Zhou, 2024. "On ABC spectral radius of uniform hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-44, July.
    6. Li, Li & Yan, Xihong & Zhang, Xinzhen, 2022. "An SDP relaxation method for perron pairs of a nonnegative tensor," Applied Mathematics and Computation, Elsevier, vol. 423(C).
    7. Shi, Tian & Qin, Yi & Yang, Qi & Ma, Zhongjun & Li, Kezan, 2023. "Synchronization of directed uniform hypergraphs via adaptive pinning control," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 615(C).
    8. 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.

    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:42:y:2021:i:3:d:10.1007_s10878-019-00424-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.

    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.