Antony, D and Das, A and Gosavi, S and Jacob, D and Kulamarva, S (2024) Spanning caterpillar in biconvex bipartite graphs. In: Discrete Applied Mathematics, 356 . pp. 32-36.
|
PDF
dis_app_mat_356_2024.pdf - Published Version Download (332kB) | Preview |
Abstract
A bipartite graph G=(A,B,E) is said to be a biconvex bipartite graph if there exist orderings <A in A and <B in B such that the neighbors of every vertex in A are consecutive with respect to <B and the neighbors of every vertex in B are consecutive with respect to <A. A caterpillar is a tree that will result in a path upon deletion of all the leaves. In this paper, we prove that there exists a spanning caterpillar in any connected biconvex bipartite graph. Besides being interesting on its own, this structural result has other consequences. For instance, this directly resolves the burning number conjecture for biconvex bipartite graphs. © 2024 Elsevier B.V.
| Item Type: | Journal Article |
|---|---|
| Publication: | Discrete Applied Mathematics |
| Publisher: | Elsevier B.V. |
| Additional Information: | The copyright for this article belongs to authors. |
| Keywords: | Biconvex bipartite graph; Bipartite graphs; Bipartite permutation graphs; Burning number; Caterpillar; Chain graph; Graph burning; Graph G, Graphic methods |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 06 Aug 2024 07:29 |
| Last Modified: | 06 Aug 2024 07:29 |
| URI: | http://eprints.iisc.ac.in/id/eprint/85237 |
Actions (login required)
 |
View Item |
