Resolvability in Hypergraphs
Imran Javaid, Azeem Haider, Muhammad Salman, Sadaf Mehtab
TL;DR
This paper extends the concepts of metric and partition dimension from graphs to hypergraphs, providing bounds and exact values under certain conditions to better understand hypergraph resolvability.
Contribution
It introduces bounds and exact values for metric and partition dimensions specifically tailored for hypergraphs, advancing the theoretical framework.
Findings
Sharp lower bounds for hypergraph metric and partition dimensions
Exact values of these dimensions under specific conditions
Enhanced understanding of hypergraph resolvability
Abstract
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified conditions.eral and give exact values with specified conditions.
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
TopicsGraph Labeling and Dimension Problems · Rings, Modules, and Algebras · Advanced Topology and Set Theory