Table of Contents
Fetching ...

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

Jing Tian, Pakanun Dokyeesun, Sandi Klavžar

TL;DR

This work investigates how vertex and edge deletions affect the three general position variants ${\rm gp}_{\rm t}$, ${\rm gp}_{\rm o}$, and ${\rm gp}_{\rm d}$ in graphs. It leverages structural characterizations, notably ${\rm gp}_{\rm t}(G) = s(G)$, ${\rm gp}_{\rm o}(G) = \omega(G_{SR})$, and the convexity criterion for ${\rm gp}_{\rm d}$, to derive tight, often sharp bounds for vertex removal, and to establish corresponding bounds for edge removal. The paper provides constructions (e.g., $G_n$, $F_n$, $M_k$, $Y_k$, $H_n$) to demonstrate extremal behavior, showing that some invariants can shift drastically or even unboundedly under deletions, while others obey near-1 or bounded changes under certain conditions. Overall, the results illuminate the stability and variability of three distinct general position notions under common graph perturbations, with implications for network robustness and metric-structure analyses.

Abstract

Let ${\rm gp}_{\rm t}(G)$, ${\rm gp}_{\rm o}(G)$, and ${\rm gp}_{\rm d}(G)$ be the total, the outer, and the dual general position number of a graph $G$. 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 ${\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, ${\rm gp}_{\rm o}(G-x)$ and ${\rm gp}_{\rm d}(G-x)$ can be respectively arbitrarily larger/smaller than ${\rm gp}_{\rm o}(G)$ and ${\rm gp}_{\rm d}(G)$. On the positive side, it is proved that if $x$ lies in some ${\rm gp}_{\rm o}$-set, then ${\rm gp}_{\rm o}(G)-1 \le {\rm gp}_{\rm o}(G-x)$, and that if $x$ is not a cut vertex and lies in some ${\rm gp}_{\rm d}$-set of $G$, then $ {\rm gp}_{\rm d}(G)-1 \le {\rm gp}_{\rm d}(G-x)$. For the edge removal, it is proved that (i) ${\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)_{e}$ is the set of simplicial vertices adjacent both endvertices of $e$, (ii) ${\rm gp}_{\rm o}(G)/2\le {\rm gp}_{\rm o}(G-e)\leq\ 2{\rm gp}_{\rm o}(G)$, and (iii) that ${\rm gp}_{\rm d}(G) - {\rm gp}_{\rm d}(G-e)$ can be arbitrarily large. All bounds proved are demonstrated to be sharp.

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

TL;DR

This work investigates how vertex and edge deletions affect the three general position variants , , and in graphs. It leverages structural characterizations, notably , , and the convexity criterion for , to derive tight, often sharp bounds for vertex removal, and to establish corresponding bounds for edge removal. The paper provides constructions (e.g., , , , , ) to demonstrate extremal behavior, showing that some invariants can shift drastically or even unboundedly under deletions, while others obey near-1 or bounded changes under certain conditions. Overall, the results illuminate the stability and variability of three distinct general position notions under common graph perturbations, with implications for network robustness and metric-structure analyses.

Abstract

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

Paper Structure

This paper contains 7 sections, 14 theorems, 17 equations, 5 figures.

Key Result

Theorem 2.1

anand-2019 Let $G$ be a graph. Then $X\subseteq V(G)$ is a general position set if and only if the components of $G[X]$ are complete subgraphs, the vertices of which form an in-transitive, distance-constant partition of $X$.

Figures (5)

  • Figure 1: Graph $G_n$.
  • Figure 2: The mushroom $M_4$.
  • Figure 3: Graph $Y_k$.
  • Figure 4: Graphs $Y'_4$ and $Y'_4-e$, and their ${\rm gp}_{\rm o}$-sets
  • Figure 5: The graph $H_n$

Theorems & Definitions (15)

  • Theorem 2.1
  • Theorem 2.2
  • Lemma 2.3
  • Proposition 3.1
  • Theorem 3.2
  • Theorem 3.3
  • Conjecture 3.4
  • Proposition 3.5
  • Proposition 3.6
  • Proposition 3.7
  • ...and 5 more