Locating-dominating sets in hypergraphs (Q1677551): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: L'udovít Niepel / rank | |||
Property / reviewed by | |||
Property / reviewed by: L'udovít Niepel / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1840153284 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1409.0662 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 21:38, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Locating-dominating sets in hypergraphs |
scientific article |
Statements
Locating-dominating sets in hypergraphs (English)
0 references
10 November 2017
0 references
The authors define locating-dominating sets in hypergraphs. The definition is a direct generalization of locating-dominating sets in graphs. The location-dominating number \( \lambda (G)\) is defined as the cardinality of a minimal locating-dominating set. Sharp bounds for \(\lambda (G)\) for general hypergraphs are presented. Exact values of \(\lambda(G)\) are found for some special classes of \(k\)-uniform hypergraphs, such as linear hypergraphs, hyperpaths, and hypercycles.
0 references
locating set
0 references
dominating set
0 references
locating-dominating set
0 references
hypergraph
0 references