Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:The subpath number of cactus graphs
Authors:ID Knor, Martin (Author)
ID Sedlar, Jelena (Author)
ID Škrekovski, Riste (Author)
ID Yang, Yu (Author)
Files:URL URL - Source URL, visit https://link.springer.com/article/10.1007/s40314-025-03545-9
 
.pdf PDF - Presentation file, download (365,21 KB)
MD5: 701C7A895A4681D6DDED9CB922778E07
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo RUDOLFOVO - Rudolfovo - Science and Technology Centre Novo Mesto
Abstract:The subpath number of a graph ▫$G$▫ is defined as the total number of subpaths in ▫$G$▫, and it is closely related to the number of subtrees, a well-studied topic in graph theory. This paper is a continuation of our previous paper Knor et al. (Knor M, Sedlar J, Škrekovski R, et al (2026) Invitation to the subpath number[J]. Appl Math Comput 509:129646), where we investigated the subpath number and identified extremal graphs within the classes of trees, unicyclic graphs, bipartite graphs, and cycle chains. Here, we focus on the subpath number of cactus graphs and characterize all maximal and minimal cacti with ▫$n$▫ vertices and ▫$k$▫ cycles. We prove that maximal cacti are cycle chains in which all interior cycles are triangles, while the two end-cycles differ in length by at most one. In contrast, the minimal cacti consist of ▫$k$▫ cycles, all of which are end-triangles, with the subgraph induced by the remaining vertices forming a forest. By comparing extremal cacti with respect to the subpath number to those that are extremal for the subtree number and the Wiener index, we demonstrate that the subpath number does not correlate with either of these quantities, as their corresponding extremal graphs differ.
Keywords:subpath number, cactus graphs, extremal graphs, cycle chains, Wiener index, subtree number
Publication status:Published
Publication version:Version of Record
Publication date:15.12.2025
Publisher:Springer
Year of publishing:2026
Number of pages:12 str.
Numbering:Vol. 45, iss. 3, [article no.] 102
PID:20.500.12556/DiRROS-27398 New window
UDC:519.17
ISSN on article:2238-3603
DOI:10.1007/s40314-025-03545-9 New window
COBISS.SI-ID:266918659 New window
Copyright:©TheAuthor(s)
Note:Soavtorji: Jelena Sedlar, Riste Škrekovski, Yu Yang; Spletna objava: 15. 12. 2025;
Publication date in DiRROS:05.02.2026
Views:469
Downloads:124
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Computational & Applied Mathematics
Shortened title:Comput. Appl. Math.
Publisher:Sociedade Brasileira de Matemática Aplicada e Computacional.
ISSN:2238-3603
COBISS.SI-ID:73925379 New window

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Back