Resolvability in Hypergraphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2014
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913391369519104 |
|---|---|
| author | Javaid, Imran Haider, Azeem Salman, Muhammad Mehtab, Sadaf |
| author_facet | Javaid, Imran Haider, Azeem Salman, Muhammad Mehtab, Sadaf |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1408_5513 |
| institution | arXiv |
| publishDate | 2014 |
| record_format | arxiv |
| spellingShingle | Resolvability in Hypergraphs Javaid, Imran Haider, Azeem Salman, Muhammad Mehtab, Sadaf Combinatorics 05C12, 05C65 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. |
| title | Resolvability in Hypergraphs |
| topic | Combinatorics 05C12, 05C65 |
| url | https://arxiv.org/abs/1408.5513 |