Digitalni repozitorij raziskovalnih organizacij Slovenije

Izpis gradiva
A+ | A- | Pomoč | SLO | ENG

Naslov:The subpath number of cactus graphs
Avtorji:ID Knor, Martin (Avtor)
ID Sedlar, Jelena (Avtor)
ID Škrekovski, Riste (Avtor)
ID Yang, Yu (Avtor)
Datoteke:URL URL - Izvorni URL, za dostop obiščite https://link.springer.com/article/10.1007/s40314-025-03545-9
 
.pdf PDF - Predstavitvena datoteka, prenos (365,21 KB)
MD5: 701C7A895A4681D6DDED9CB922778E07
 
Jezik:Angleški jezik
Tipologija:1.01 - Izvirni znanstveni članek
Organizacija:Logo RUDOLFOVO - Rudolfovo – Znanstveno in tehnološko središče Novo mesto
Povzetek: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.
Ključne besede:subpath number, cactus graphs, extremal graphs, cycle chains, Wiener index, subtree number
Status publikacije:Objavljeno
Verzija publikacije:Objavljena publikacija
Datum objave:15.12.2025
Založnik:Springer
Leto izida:2026
Št. strani:12 str.
Številčenje:Vol. 45, iss. 3, [article no.] 102
PID:20.500.12556/DiRROS-27398 Novo okno
UDK:519.17
ISSN pri članku:2238-3603
DOI:10.1007/s40314-025-03545-9 Novo okno
COBISS.SI-ID:266918659 Novo okno
Avtorske pravice:©TheAuthor(s)
Opomba:Soavtorji: Jelena Sedlar, Riste Škrekovski, Yu Yang; Spletna objava: 15. 12. 2025;
Datum objave v DiRROS:05.02.2026
Število ogledov:467
Število prenosov:122
Metapodatki:XML DC-XML DC-RDF
:
Kopiraj citat
  
Objavi na:Bookmark and Share


Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Gradivo je del revije

Naslov:Computational & Applied Mathematics
Skrajšan naslov:Comput. Appl. Math.
Založnik:Sociedade Brasileira de Matemática Aplicada e Computacional.
ISSN:2238-3603
COBISS.SI-ID:73925379 Novo okno

Licence

Licenca:CC BY 4.0, Creative Commons Priznanje avtorstva 4.0 Mednarodna
Povezava:http://creativecommons.org/licenses/by/4.0/deed.sl
Opis:To je standardna licenca Creative Commons, ki daje uporabnikom največ možnosti za nadaljnjo uporabo dela, pri čemer morajo navesti avtorja.

Nazaj