Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.08270

Mutual-Visibility of Tree and Its Line Graphs

Tonny K B·Shikhi M
View original source ↗Read source document ↗Export metadata ↓

Abstract

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$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tonny K B, Shikhi M. 2026-05-19. Mutual-Visibility of Tree and Its Line Graphs. https://arxiv.org/abs/2601.08270

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗