Locating-Dominating sets in Hypergraphs
Muhammad Fazil, Imran Javaid, Muhammad Salman, Usman Ali
TL;DR
This paper extends the concept of locating-dominating sets from graphs to hypergraphs, providing theoretical bounds, exact values under certain conditions, and exploring specific hypergraph cases.
Contribution
It introduces the study of locating-dominating sets in hypergraphs, offering new bounds, exact values, and analysis for particular hypergraph classes.
Findings
Established sharp bounds for the location-domination number in hypergraphs.
Derived exact values for specific hypergraph classes.
Analyzed locating-dominating sets in particular hypergraph examples.
Abstract
A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the location-domination number of hypergraphs in general and exact values with specified conditions are investigated. Moreover, locating-dominating sets in some specific hypergraphs are found.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph Labeling and Dimension Problems