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

Invitation to the subpath number

Author

Listed:
  • Knor, Martin
  • Sedlar, Jelena
  • Škrekovski, Riste
  • Yang, Yu

Abstract

In this paper we count all the subpaths of a given graph G, including the subpaths of length zero, and we call this quantity the subpath number of G. The subpath number is related to the extensively studied number of subtrees, as it can be considered as counting subtrees with the additional requirement of maximum degree being two. We first give the explicit formula for the subpath number of trees and unicyclic graphs. We show that among connected graphs on the same number of vertices, the minimum of the subpath number is attained for any tree and the maximum for the complete graph. Further, we show that the complete bipartite graph with partite sets of almost equal size maximizes the subpath number among all bipartite graphs. The explicit formula for cycle chains, i.e. graphs in which two consecutive cycles share a single edge, is also given. This family of graphs includes the unbranched catacondensed benzenoids which implies a possible application of the result in chemistry. The paper is concluded with several directions for possible further research where several conjectures are provided.

Suggested Citation

  • Knor, Martin & Sedlar, Jelena & Škrekovski, Riste & Yang, Yu, 2026. "Invitation to the subpath number," Applied Mathematics and Computation, Elsevier, vol. 509(C).
    • Handle: RePEc:eee:apmaco:v:509:y:2026:i:c:s0096300325003728
    DOI: 10.1016/j.amc.2025.129646
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325003728
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129646?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

    for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:509:y:2026:i:c:s0096300325003728. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.