20.500.12556/DKUM-92987 Mutual-visibility and general position sets in Sierpiński triangle graphs For a given graph G, the general position problem asks for the largest size of a set of vertices M ⊆ V(G) such that no three distinct vertices of M belong to a common shortest path in G. A relaxation of this concept is based on the condition that two vertices x, y ∈ V(G) are M-visible, meaning there exists a shortest x, y-path in G that does not pass through any vertex of M \ {x, y}. If every pair of vertices in M is M-visible, then M is called a mutual-visibility set of G. The cardinality of the largest mutual-visibility set of G is called the mutual-visibility number of G. Some wellknown variations of this concept consider the total, outer, and dual mutual-visibility sets of a graph. We present results on the general position problem and the various mutual-visibility problems in Sierpi ´nski triangle graphs. general position mutual visibility Sierpinski triangle graph splošna lega medsebojna vidnost graf trikotnika Sierpinskega true true false Springer Link Angleški jezik Slovenski jezik https://link.springer.com/article/10.1007/s40840-025-01887-5 © 2025, The Author(s) Članek v reviji 2025-05-29 13:20:07 2025-05-29 13:20:07 2025-05-30 03:10:32 0000-00-00 00:00:00 2025 0 0 19 str. [article no.] 106 Vol. 48 May 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2025-04-30 2025-05-05 2025-05-23 519.17 237461251 10.1007/s40840-025-01887-5 2180-4206 s40840-025-01887-5_(1).pdf s40840-025-01887-5_(1).pdf 1 6D7AE957E33217AB44DB5CEDE06C9378 6df8d26b49c2b318f18510835918187e7874883b0c7c3a296ed83032a14aae15 4325c0f9-3c80-11f0-b9c3-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=191495 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0