The spectral radius and domination number in linear uniform hypergraphs

Liying Kang (), Wei Zhang () and Erfang Shan ()
Additional contact information
Liying Kang: Shanghai University
Wei Zhang: National University of Singapore
Erfang Shan: Shanghai University

Journal of Combinatorial Optimization, No 0, 12 pages

Abstract: 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.

Keywords: Uniform hypergraph; Spectral radius; Signless Laplacian spectral radius; Domination (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00424-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-019-00424-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00424-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().