Mutual-Visibility of Tree and Its Line Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911697954930688 |
|---|---|
| author | B, Tonny K M, Shikhi |
| author_facet | B, Tonny K M, Shikhi |
| contents | In this paper, we present a complete characterization of mutual-visibility sets in trees. It is shown that a subset $S$ is a mutual-visibility set of a tree $T$ if and only if it coincides with the set of leaves of the Steiner subtree $T\langle S\rangle$. For trees containing branch vertices, the notion of legs is introduced, and an explicit formula for the number of maximal mutual-visibility sets is derived in terms of the corresponding leg lengths. We prove that every tree is absolute-clear. It is further shown that, for every tree $T$ with at least two edges, the mutual-visibility number is preserved under the line graph operation, that is, $μ(L(T))=μ(T)$. Examples of unicyclic and block graphs for which this equality fails are also presented. Finally, a tight lower bound for the mutual-visibility number of the iterated line graph is established; namely, $μ\bigl(L(L(T))\bigr)\ge \left\lfloor \frac{Δ(T)^2}{3}\right\rfloor$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_08270 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Mutual-Visibility of Tree and Its Line Graphs B, Tonny K M, Shikhi Combinatorics 05C05, 05C30, 05C76 In this paper, we present a complete characterization of mutual-visibility sets in trees. It is shown that a subset $S$ is a mutual-visibility set of a tree $T$ if and only if it coincides with the set of leaves of the Steiner subtree $T\langle S\rangle$. For trees containing branch vertices, the notion of legs is introduced, and an explicit formula for the number of maximal mutual-visibility sets is derived in terms of the corresponding leg lengths. We prove that every tree is absolute-clear. It is further shown that, for every tree $T$ with at least two edges, the mutual-visibility number is preserved under the line graph operation, that is, $μ(L(T))=μ(T)$. Examples of unicyclic and block graphs for which this equality fails are also presented. Finally, a tight lower bound for the mutual-visibility number of the iterated line graph is established; namely, $μ\bigl(L(L(T))\bigr)\ge \left\lfloor \frac{Δ(T)^2}{3}\right\rfloor$. |
| title | Mutual-Visibility of Tree and Its Line Graphs |
| topic | Combinatorics 05C05, 05C30, 05C76 |
| url | https://arxiv.org/abs/2601.08270 |