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

Algorithms for enumerating multiple leaf-distance granular regular α-subtree of unicyclic and edge-disjoint bicyclic graphs

Author

Listed:
  • Li, Long
  • Yang, Yu
  • Hui, Zhi-hao
  • Jin, Bang-Bang
  • Wang, Hua
  • Fahad, Asfand
  • Zhang, Heng

Abstract

A multiple leaf-distance granular regular α-tree (abbreviated as LDR α-tree for short) is a tree (with at least α+1 vertices) where any two leaves are at some distance divisible by α. A connected graph's subtree which is additionally an LDR α-tree is known as an LDR α-subtree. Obviously, α=1 and 2, correspond to the general subtrees (excluding the single vertex subtrees) and the BC-subtrees (the distance between any two leaves of the subtree is even), respectively. With generating functions and structure decomposition, in this paper, we propose algorithms for enumerating an auxiliary subtree ατ(v)-subtree (τ=0,1,…,α−1) containing a fixed vertex, and various LDR α-subtrees of unicyclic graphs, respectively. Basing on these algorithms, we further present algorithms for enumerating various LDR α-subtrees of edge-disjoint bicyclic graphs.

Suggested Citation

  • Li, Long & Yang, Yu & Hui, Zhi-hao & Jin, Bang-Bang & Wang, Hua & Fahad, Asfand & Zhang, Heng, 2024. "Algorithms for enumerating multiple leaf-distance granular regular α-subtree of unicyclic and edge-disjoint bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 462(C).
    • Handle: RePEc:eee:apmaco:v:462:y:2024:i:c:s0096300323005039
    DOI: 10.1016/j.amc.2023.128334
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323005039
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128334?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. Dale R. Fox, 1988. "Block cutpoint decomposition for markovian queueing systems," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 4(2), pages 101-114, June.
    2. Yang, Yu & Liu, Hongbo & Wang, Hua & Fu, Hongsun, 2015. "Subtrees of spiro and polyphenyl hexagonal chains," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 547-560.
    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.
    1. Yu Yang & An Wang & Hua Wang & Wei-Ting Zhao & Dao-Qiang Sun, 2019. "On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution," Mathematics, MDPI, vol. 7(5), pages 1-19, May.
    2. Yang, Yu & Fan, Ai-wan & Wang, Hua & Lv, Hailian & Zhang, Xiao-Dong, 2019. "Multi-distance granularity structural α-subtree index of generalized Bethe trees," Applied Mathematics and Computation, Elsevier, vol. 359(C), pages 107-120.
    3. Chen, Ailian & Xiong, Xianzhu & Lin, Fenggen, 2016. "Distance-based topological indices of the tree-like polyphenyl systems," Applied Mathematics and Computation, Elsevier, vol. 281(C), pages 233-242.
    4. Yu Yang & Long Li & Wenhu Wang & Hua Wang, 2020. "On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs," Mathematics, MDPI, vol. 9(1), pages 1-29, December.

    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:462:y:2024:i:c:s0096300323005039. 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.