Metric Dimension of a Direct Product of Three Complete Graphs: The Middle Cone Family
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909698601517056 |
|---|---|
| author | Foster-Greenwood, Briana Uhl, Christine |
| author_facet | Foster-Greenwood, Briana Uhl, Christine |
| contents | In previous work, we determined the metric dimension for a direct product of three isomorphic complete graphs. Turning to the case where the complete graphs may have different orders, there are three families we refer to as the upper, lower, and middle cones. We determine the metric dimension and location-total-domination number for a family of direct products of three complete graphs stemming from the middle cone. We explicitly describe minimum resolving sets. To verify the sets are resolving, we define a basic landmark system and show it will be a resolving set if and only if its associated 3-edge-colored hypergraph avoids three types of forbidden subgraphs. This generalizes the technique used for three isomorphic factors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_16169 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Metric Dimension of a Direct Product of Three Complete Graphs: The Middle Cone Family Foster-Greenwood, Briana Uhl, Christine Combinatorics 05C69 (Primary) 05C12, 05B30, 05C15 (Secondary) In previous work, we determined the metric dimension for a direct product of three isomorphic complete graphs. Turning to the case where the complete graphs may have different orders, there are three families we refer to as the upper, lower, and middle cones. We determine the metric dimension and location-total-domination number for a family of direct products of three complete graphs stemming from the middle cone. We explicitly describe minimum resolving sets. To verify the sets are resolving, we define a basic landmark system and show it will be a resolving set if and only if its associated 3-edge-colored hypergraph avoids three types of forbidden subgraphs. This generalizes the technique used for three isomorphic factors. |
| title | Metric Dimension of a Direct Product of Three Complete Graphs: The Middle Cone Family |
| topic | Combinatorics 05C69 (Primary) 05C12, 05B30, 05C15 (Secondary) |
| url | https://arxiv.org/abs/2507.16169 |