English

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

Combinatorics 2026-02-04 v2

Abstract

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

Keywords

Cite

@article{arxiv.2510.01294,
  title  = {On the variety of general position problems under vertex and edge removal},
  author = {Jing Tian and Pakanun Dokyeesun and Sandi Klavžar},
  journal= {arXiv preprint arXiv:2510.01294},
  year   = {2026}
}