The spectral radius and domination number in linear uniform hypergraphs
From MaRDI portal
Publication:2051910
DOI10.1007/s10878-019-00424-yzbMath1481.05098OpenAlexW2946359056WikidataQ127822063 ScholiaQ127822063MaRDI QIDQ2051910
Wei Zhang, Erfang Shan, Li-ying Kang
Publication date: 25 November 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00424-y
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalizations of the Brunn-Minkowski inequality
- Spectra of uniform hypergraphs
- Hypergraphs with large domination number and with edge sizes at least three
- Some spectral properties of uniform hypergraphs
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
- Transversals and domination in uniform hypergraphs
- Bounds on graph eigenvalues. I
- Perron-Frobenius theorem for nonnegative tensors
- A sharp upper bound on algebraic connectivity using domination number
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Matching and domination numbers in \(r\)-uniform hypergraphs
- A general product of tensors with applications
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
- A note on Laplacian eigenvalues and domination
- Eigenvalues of a real supersymmetric tensor
- Domination in hypergraphs
- A survey on the spectral theory of nonnegative tensors
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors
- Hypergraph domination and strong independence
- Total Domination in Graphs
- Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
This page was built for publication: The spectral radius and domination number in linear uniform hypergraphs
