General position and mutual-visibility in shadow graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914283977179136 |
|---|---|
| author | S., Haritha S. V, Ullas Chandran |
| author_facet | S., Haritha S. V, Ullas Chandran |
| contents | The \emph{general position problem} in graphs asks for a largest set of vertices in which no three lie on a common shortest path. The \emph{mutual-visibility problem} seeks a largest set of vertices such that every pair is connected by a shortest path whose internal vertices lie outside the set. In this paper, we investigate the general position and mutual-visibility problems for shadow graphs. Sharp general bounds are established for both the general position number and the mutual-visibility number of shadow graphs, and classes of graphs attaining these extremal values are characterized. Furthermore, these invariants are determined for several standard classes of shadow graphs, including shadow graphs of cycles, multipartite graphs, and trees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_19769 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | General position and mutual-visibility in shadow graphs S., Haritha S. V, Ullas Chandran Combinatorics 05C12, 05C69 The \emph{general position problem} in graphs asks for a largest set of vertices in which no three lie on a common shortest path. The \emph{mutual-visibility problem} seeks a largest set of vertices such that every pair is connected by a shortest path whose internal vertices lie outside the set. In this paper, we investigate the general position and mutual-visibility problems for shadow graphs. Sharp general bounds are established for both the general position number and the mutual-visibility number of shadow graphs, and classes of graphs attaining these extremal values are characterized. Furthermore, these invariants are determined for several standard classes of shadow graphs, including shadow graphs of cycles, multipartite graphs, and trees. |
| title | General position and mutual-visibility in shadow graphs |
| topic | Combinatorics 05C12, 05C69 |
| url | https://arxiv.org/abs/2601.19769 |