Dhanya Roy

most citedMutual-visibility and general position in double graphs and in Mycielskians

3 citations · 3 across the 3 of their papers we have counts for

collaborators

4 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…

math.CO2024★ 3 cited

Mutual-visibility and general position in double graphs and in Mycielskians

Dhanya Roy, Sandi Klavžar, Aparna Lakshmanan

The general position problem in graphs is to find the maximum number of vertices that can be selected such that no three vertices lie on a common shortest path. The mutual-visibili…

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

Mutual-visibility and general position in double graphs and in Mycielskians

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