The $1$-nearly vertex independence number of a graph

Abstract

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A set $I_0(G) \subseteq V(G)$ is a vertex independent set if no two vertices in $I_0(G)$ are adjacent in $G$. We study $α_1(G)$, which is the maximum cardinality of a set $I_1(G) \subseteq V(G)$ that contains exactly one pair of adjacent vertices of $G$. We call $I_1(G)$ a $1$-nearly vertex independent set of $G$ and $α_1(G)$ a $1$-nearly vertex independence number of $G$. We provide some cases of explicit formulas for $α_1$. Furthermore, we prove a tight lower (resp. upper) bound on $α_1$ for graphs of order $n$. The extremal graphs that achieve equality on each bound are fully characterised.

Theorems & Definitions (30)

• Theorem 1: rad2016note
• Lemma 1
• proof
• Lemma 2
• proof
• Theorem 2
• proof
• Definition 1
• Theorem 3
• proof