4 citations · 14 across the 17 of their papers we have counts for
8 papers · 1 filter
Visibility polynomials, dual visibility spectrum, and characterization of total mutual-visibility sets
Csilla Bujtás, Sandi Klavžar, Jing Tian
Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the…
Counting largest mutual-visibility and general position sets of glued -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…
General position problems in strong and lexicographic products of graphs
Pakanun Dokyeesun, Sandi Klavžar, Dorota Kuziak +1
Outer, dual, and total general position sets are studied on strong and lexicographic products of graphs. Sharp lower and upper bounds are proved for the outer and the dual general…
The general position number under vertex and edge removal
Pakanun Dokyeesun, Sandi Klavžar, Jing Tian
Let be the general position number of a graph . It is proved that holds for any vertex of a connected graph and that if $x…
General position sets, colinear sets, and Sierpiński product graphs
Sandi Klavžar, Jing Tian
Let denote the Sierpiński product of graphs and with respect to the function . The Sierpiński general position number is intro…
Metric dimensions of generalized Sierpiński graphs over squares
Savari Prabhu, T. Jenifer Janany, Sandi Klavžar
Metric dimension is a valuable parameter that helps address problems related to network design, localization, and information retrieval by identifying the minimum number of landmar…
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…
Variety of general position problems in graphs
Jing Tian, Sandi Klavžar
Let be a vertex subset of a graph . Then are -positionable if holds for any shortest -path . If each two vertices fr…