IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v438y2023ics0096300322006488.html
   My bibliography  Save this article

Burnability of double spiders and path forests

Author

Listed:
  • Tan, Ta Sheng
  • Teh, Wen Chean

Abstract

The burning number of a graph can be used to measure the spreading speed of contagion in a network. The burning number conjecture is arguably the main unresolved conjecture related to this graph parameter, which can be settled by showing that every tree of order m2 has burning number at most m. This is known to hold for many classes of trees, including spiders - trees with exactly one vertex of degree greater than two. In fact, it has been verified that certain spiders of order slightly larger than m2 also have burning numbers at most m, a result that has then been conjectured to be true for all trees. The first focus of this paper is to verify this slightly stronger conjecture for double spiders - trees with two vertices of degrees at least three and they are adjacent. Our other focus concerns the burning numbers of path forests, a class of graphs in which their burning numbers are naturally related to that of spiders and double spiders. Here, our main result shows that a path forest of order m2 with a sufficiently long shortest path has burning number exactly m, the smallest possible for any path forest of the same order.

Suggested Citation

  • Tan, Ta Sheng & Teh, Wen Chean, 2023. "Burnability of double spiders and path forests," Applied Mathematics and Computation, Elsevier, vol. 438(C).
    • Handle: RePEc:eee:apmaco:v:438:y:2023:i:c:s0096300322006488
    DOI: 10.1016/j.amc.2022.127574
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322006488
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127574?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tan, Ta Sheng & Teh, Wen Chean, 2020. "Graph burning: Tight bounds on the burning numbers of path forests and spiders," Applied Mathematics and Computation, Elsevier, vol. 385(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:438:y:2023:i:c:s0096300322006488. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.