- Title
- Vertex and edge dimension of hypergraphs
- Creator
- Manrique, Martín; Arumugam, S.
- Relation
- Graphs and Combinatorics Vol. 31, Issue 1, p. 183-200
- Publisher Link
- http://dx.doi.org/10.1007/s00373-013-1384-y
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2015
- Description
- Let G = (V, E) be a connected graph and let W=(w1,...,wk) be an ordered subset of V. The k-vector r(v|W)=(d(v,w1),...,d(v,wk)) is called the metric representation of v with respect to W. The set W is a resolving set of G if r(u|W) = r(v|W) implies u = v. The minimum cardinality of a resolving set in G is the metric dimension of G. In this paper we extend the notion of metric dimension to hypergraphs. We also introduce the dual concept, that is, edge dimension for hypergraphs, and initiate a study on this parameter.
- Subject
- resolving set; metric dimension; dual hypergraph
- Identifier
- http://hdl.handle.net/1959.13/1309382
- Identifier
- uon:21856
- Identifier
- ISSN:0911-0119
- Language
- eng
- Reviewed
- Hits: 883
- Visitors: 847
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|