Digital repository of Slovenian research organisations

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

Title:Invitation to the subpath number
Authors:ID Knor, Martin (Author)
ID Sedlar, Jelena (Author)
ID Škrekovski, Riste (Author)
ID Yang, Yu (Author)
Files:URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0096300325003728
 
.pdf PDF - Presentation file, download (1,26 MB)
MD5: 120E3F3232C848A5EC428710AAEF1F84
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo RUDOLFOVO - Rudolfovo - Science and Technology Centre Novo Mesto
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.
Keywords:graphs, subpath number, number of subtrees, unbranched catacondensed benzenoids
Publication status:Published
Publication version:Version of Record
Submitted for review:27.02.2025
Publication date:25.07.2025
Publisher:Elsevier Inc.
Year of publishing:2026
Number of pages:11 str.
Numbering:Vol. 509, [article no.] 129646
PID:20.500.12556/DiRROS-25715 New window
UDC:519.17
ISSN on article:0096-3003
DOI:10.1016/j.amc.2025.129646 New window
COBISS.SI-ID:259072003 New window
Copyright:© 2025 The Authors
Note:Soavtorji: Jelena Sedlar, Riste Škrekovski, Yu Yang;
Publication date in DiRROS:17.06.2026
Views:60
Downloads:39
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:Applied mathematics and computation
Shortened title:Appl. math. comput.
Publisher:Elsevier
ISSN:0096-3003
COBISS.SI-ID:24983808 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0383-2017
Name:Kompleksna omrežja

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-3002-2021
Name:Prirejanja in barvanja povezav v kubičnih grafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:BI-HR/25-27-004-2025
Name:Barvanja in razdalje v grafih

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.

Back