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 $\alpha_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 $\alpha_1(G)$ a $1$-nearly vertex independence number of $G$. We provide some cases of explicit formulas for $\alpha_1$. Furthermore, we prove a tight lower (resp. upper) bound on $\alpha_1$ for graphs of order $n$. The extremal graphs that achieve equality on each bound are fully characterised.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2024
- DOI:
- 10.48550/arXiv.2406.16668
- arXiv:
- arXiv:2406.16668
- Bibcode:
- 2024arXiv240616668S
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- 14 pages. arXiv admin note: text overlap with arXiv:2309.05356