Varieties of mutual-visibility and general position on Sierpi\'nski graphs

Abstract

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 such sets. In this paper, these eight invariants are investigated on Sierpi\'nski graphs Spn. They are determined for the Sierpi\'nski graphs Sp2, p 3. All, but the outer mutual-visibility number and the outer general position number, are also determined for S3n, n 3. In many of the cases the corresponding extremal sets are enumerated.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…