Showing math.COShow all
3 papers · 1 filter
math.CO2024
Mutual-visibility and general position sets in Sierpiński triangle graphs
Danilo Korže, Aleksander Vesel
For a given graph \(G\), the general position problem asks for the largest set of vertices \(M \subseteq V(G)\) such that no three distinct vertices of \(M\) belong to a common sho…
math.CO2024
Variety of mutual-visibility problems in hypercubes
Danilo Korže, Aleksander Vesel
Let be a graph and . Vertices are -visible if there exists a shortest -path of that does not pass through any vertex of $M \setminus…
math.CO2023
Mutual-visibility sets in Cartesian products of paths and cycles
Danilo Korže, Aleksander Vesel
For a given graph , the mutual-visibility problem asks for the largest set of vertices with the property that for any pair of vertices there exist…