On the variety of general position problems under vertex and edge removal

Abstract

Let gp t(G), gp o(G), and gp d(G) be the total, the outer, and the dual general position number of a graph G, respectively. This paper investigates how removing a vertex or removing an edge affects these graph invariants. It is proved that if x is not a cut vertex, then gp t(G) -1 gp t(G-x) gp t(G) + degG(x). On the other hand, gp o(G-x) and gp d(G-x) can be respectively arbitrarily larger/smaller than gp o(G) and gp d(G). On the positive side, it is proved that if x lies in some gp o-set, then gp o(G)-1 gp o(G-x), and that if x is not a cut vertex and lies in some gp d-set of G, then gp d(G)-1 gp d(G-x). For the edge removal, it is proved that (i) gp t(G) -|S(G)e| gp t(G-e) gp t(G) +2, where S(G)e is the set of simplicial vertices adjacent to both endvertices of e, (ii) gp o(G)/2 gp o(G-e)≤\ 2 gp o(G), and (iii) that gp d(G) - gp d(G-e) can be arbitrarily large. All bounds are demonstrated to be sharp.

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…