On Maximum Induced Forests of the Balanced Bipartite Graphs

Abstract: We are examining a specific type of graph called a balanced bipartite graph. The balanced bipartite graph, such as $\mathcal{B}$, has two parts, $V_1$ and $V_2$, each containing $n$ vertices, for a total of $2n$ vertices. The degree of a vertex $v$ in $V_1\cup\,V_2$ is denoted by $d_\mathcal{B}(v)$. The minimum degree of any vertex in the graph $\mathcal{B}$ is represented by $\delta(\mathcal{B})$. If $S$ is a subset of $V_1\cup\,V_2$, then the subgraph of $\mathcal{B}$ induced by $S$ is the graph that has $S$ as its vertex set and contains all the edges of $\mathcal{B}$ that have both endpoints in $S$. This subgraph is denoted by $\mathcal{B}[S]$. The forest number of a graph $\mathcal{B}$ is the size of the largest subset of vertices of $\mathcal{B}$ that form an induced forest. We use $f(\mathcal{B})$ to represent the forest number of graph $\mathcal{B}$. A decycling set or a feedback vertex set of a graph is a set of vertices whose removal results in a forest. The smallest possible size of a decycling set of $\mathcal{B}$ is represented by $\nabla(\mathcal{B})$. Finding the decycling number of $\mathcal{B}$ is equivalent to determining the largest order of an induced forest, i.e., $f(\mathcal{B})+\nabla(\mathcal{B})=2n$. In this essay, we study the structure and cardinality of the largest subsets of vertices of graph $\mathcal{B}$ that form induced forests.