Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs

TL;DR

This paper investigates the relationship between p-independence numbers of regular graphs and their line graphs, establishing conditions under which one bounds the other and exploring related conjectures.

Contribution

It characterizes valid alpha-triples (p, q, r) where p-independence numbers of graphs are bounded by those of their line graphs for various parameters, extending prior work.

Findings

Identifies conditions for valid alpha-triples involving p, q, r.

Establishes bounds for p-independence numbers in regular graphs.

Links the problem to conjectures in graph theory.

Abstract

Let $G$ be a simple graph and let $L(G)$ denote the \emph{line graph} of $G$. A \emph{$p$-independent} set in $G$ is a set of vertices $S \subseteq V(G)$ such that the subgraph induced by $S$ has maximum degree at most $p$. The \emph{$p$-independence number} of $G$, denoted by $\alpha_p(G)$, is the cardinality of a maximum $p$-independent set in $G$. In this paper, and motivated by the recent result that independence number is at most matching number for regular graphs~\cite{CaDaPe2020}, we investigate which values of the non-negative integers $p$, $q$, and $r$ have the property that $\alpha_p(G) \leq \alpha_q(L(G))$ for all r-regular graphs. Triples $(p, q, r)$ having this property are called \emph{valid $\alpha$-triples}. Among the results we prove are: \begin{itemize} \item $(p, q, r)$ is valid $\alpha$-triple for $p \geq 0$, $q \geq 3$ , and $r\geq 2$. \item $(p, q, r)$ is valid $\alpha$-triple for $p \leq q < 3$ and $r\geq 2$. \item $(p, q, r)$ is valid $\alpha$-triple for $p \geq 0$, $q = 2$, and $r$ even. \item $(p, q, r)$ is valid $\alpha$-triple for $p \geq 0$, $q = 2$, and $r$ odd with $r = \max \Big \{ 3, \frac{17(p+1)}{16}\Big \}$. \end{itemize} We also show a close relation between undetermined possible valid $\alpha$-triples, the Linear Aboricity Conjecture, and the Path-Cover Conjecture.