Dhanya Roy

collaborators

3 papers

cs.DM2025

The vertex visibility number of graphs

Dhanya Roy, Gabriele Di Stefano, Sandi KlavÅ¾ar +1

If $x \in V (G)$ , then $S \subseteq V (G) ∖ {x}$ is an $x$ -visibility set if for any $y \in S$ there exists a shortest $x, y$ -path avoiding $S$ . The $x$ -visibility number $v_x(G)…

math.CO2025

Varieties of mutual-visibility and general position on SierpiÅski graphs

Dhanya Roy, Sandi KlavÅ¾ar, Aparna Lakshmanan +1

The variety of mutual-visibility problems contains four members, as does the variety of general position problems. The basic problem is to determine the cardinality of the largest…

math.CO2024

Counting largest mutual-visibility and general position sets of glued $t$ -ary trees

Dhanya Roy, Sandi KlavÅ¾ar, Aparna Lakshmanan S

All four invariants of the mutual-visibility problem and, all four invariants of the general position problem are determined for glued binary trees. The number of the corresponding…

The vertex visibility number of graphs

Varieties of mutual-visibility and general position on SierpiÅski graphs

Counting largest mutual-visibility and general position sets of glued t-ary trees

Varieties of mutual-visibility and general position on SierpiÅski graphs

Counting largest mutual-visibility and general position sets of glued $t$ -ary trees