Resolvability in Hypergraphs
Combinatorics
2024-06-18 v2
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.
Cite
@article{arxiv.1408.5513,
title = {Resolvability in Hypergraphs},
author = {Imran Javaid and Azeem Haider and Muhammad Salman and Sadaf Mehtab},
journal= {arXiv preprint arXiv:1408.5513},
year = {2024}
}