On Maximum Induced Forests of the Balanced Bipartite Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915621925552128 |
|---|---|
| author | Ghalavand, Ali Li, Xueliang |
| author_facet | Ghalavand, Ali Li, Xueliang |
| contents | The decycling number $\nabla(G)$ of a graph $G$ is the minimum number of vertices that must be removed to eliminate all cycles in $G$. The forest number $f(G)$ is the maximum number of vertices that induce a forest in $G$. So $\nabla(G) + f(G) = |V(G)|$. For the Cartesian product $T \,\square\, T'$ of trees $T$ and $T'$ it is proved that $\nabla(S_n \,\square\, S_{n'}) \leq \nabla(T \,\square\, T')$, thus resolving the conjecture of Wang and Wu asserting that $f(T \,\square\, T') \leq f(S_n \,\square\, S_{n'})$. It is shown that $\nabla(T \,\square\, T') \ge\min\{ |V(T)|,|V(T')|\} - 1$ and the equality cases characterized. For prisms over trees, it is proved that $\nabla(T\,\square\, K_2) = α'(T)$, and for arbitrary graphs $G_1$ and $G_2$, it is proved that $\nabla(G_1 \,\square\, G_2) \geq α'(G_1) α'(G_2)$, where $α'$ is the matching number. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_05145 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Maximum Induced Forests of the Balanced Bipartite Graphs Ghalavand, Ali Li, Xueliang Combinatorics The decycling number $\nabla(G)$ of a graph $G$ is the minimum number of vertices that must be removed to eliminate all cycles in $G$. The forest number $f(G)$ is the maximum number of vertices that induce a forest in $G$. So $\nabla(G) + f(G) = |V(G)|$. For the Cartesian product $T \,\square\, T'$ of trees $T$ and $T'$ it is proved that $\nabla(S_n \,\square\, S_{n'}) \leq \nabla(T \,\square\, T')$, thus resolving the conjecture of Wang and Wu asserting that $f(T \,\square\, T') \leq f(S_n \,\square\, S_{n'})$. It is shown that $\nabla(T \,\square\, T') \ge\min\{ |V(T)|,|V(T')|\} - 1$ and the equality cases characterized. For prisms over trees, it is proved that $\nabla(T\,\square\, K_2) = α'(T)$, and for arbitrary graphs $G_1$ and $G_2$, it is proved that $\nabla(G_1 \,\square\, G_2) \geq α'(G_1) α'(G_2)$, where $α'$ is the matching number. |
| title | On Maximum Induced Forests of the Balanced Bipartite Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2501.05145 |