2025/03/01 by Martin Knor, Jelena Sedlar, Knor, Martin +5
Computer Science · Mathematics · #05C30 #05C38 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2503.00558
openalex publication_date 2025/03/01 · openalex created_date 2025/10/12 · openalex updated_date 2026/07/28
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.