Abstract
This article presents an extension of the study of metric and partition dimension to hypergraphs. We give sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified conditions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
