Jelena Sedlar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jelena Sedlar has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Riste Škrekovski
University of Ljubljana, FMF, Ljubljana, Slovenia
9 shared publications Riste Škrekovski
Faculty of Information Studies, Novo mesto, Slovenia
5 shared publications- Martin Knor
Slovak University of Technology in Bratislava
3 shared publications Damir Vukičević
Univ Split, Dept Math, R Boskovica 33, Split 21000, Croatia
2 shared publicationsIztok Peterin
University of Maribor, FEECS, Maribor, Slovenia
2 shared publicationsSaša Vujošević
2 shared publications
Latest Publications
- Open Access
- 12 March 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 3 (96) , 961
Subtree Number versus Wiener Index
The subtree number N(G) of a graph G is defined as the number of non-empty subtrees of G. The Wiener index W(G) of a graph G is defined as the sum of distances over all pairs of vertices in G. It has been noted that, for many families of trees and graphs, the graphs that achieve the largest number of subtrees are exactly those that attain the smallest Wiener index, and vice versa. Consequently, it is often said that the subtree number and the Wiener index have a ”negative” correlation. In this paper, we show that, except for extremal graphs, this ”negative” correlation does not generally hold. In particular, for every n ≥ 14, we construct a pair of unicyclic graphs G and H, each having n vertices and identical degree sequences, such that W(G) < W(H) and N(G) < N(H). Furthermore, our construction shows that both differences, N(H) − N(G) and W(H) − W(G), grow unbounded as n increases.
- 12 March 2026
- Published by University Library in Kragujevac in Match Communications in Mathematical and in Computer Chemistry
- Vol. 3 (96) , 961
Open AccessSubtree Number versus Wiener Index
The subtree number N(G) of a graph G is defined as the number of non-empty subtrees of G. The Wiener index W(G) of a graph G is defined as the sum of distances over all pairs of vertices in G. It has been noted that, for many families of trees and graphs, the graphs that achieve the largest number of subtrees are exactly those that attain the smallest Wiener index, and vice versa. Consequently, it is often said that the subtree number and the Wiener index have a ”negative” correlation. In this paper, we show that, except for extremal graphs, this ”negative” correlation does not generally hold. In particular, for every n ≥ 14, we construct a pair of unicyclic graphs G and H, each having n vertices and identical degree sequences, such that W(G) < W(H) and N(G) < N(H). Furthermore, our construction shows that both differences, N(H) − N(G) and W(H) − W(G), grow unbounded as n increases.
- 1 March 2026
- Published by Faculty of Civil Engineering, Architecture and Geodesy, University of Split
Diferencijalna geometrija
Ovaj udžbenik je nastao na temelju predavanja iz predmeta Diferencijalna geometrija koja držim duži niz godina na prijediplomskom studiju Geodezija i geoinformatika Fakulteta građevinarstva, arhitekture i geodezije u Splitu. Obzirom na to u izlaganju se koristi što je manje moguće složenih matematičkih pojmova kojima studenti tehničkih fakulteta ne vladaju, tako da ga mogu pratiti ne samo studenti studija Geodezija i geoinformatika nego studenti svih tehničkih fakulteta koji su odslušali osnovne matematičke predmete. No, udžbenik je precizno matematički pisan, sa preciznim iskazima i dokazima tvrdnji, tako da posve dobro može poslužiti i kao udžbenik na studiju matematike. Postoji brojna literatura koja se bavi diferencijalnom geometrijom, ali obzirom da se tom sadržaju može pristupiti iz više različitih smjerova, knjige različitih autora mogu se jako razlikovati u načinu izlaganja do razine da se neupućenom čitatelju može činiti da se tu ne radi o istom sadržaju, čak niti sličnom. Zato su ovdje u popisu literature navedene samo neke od knjiga koje sadržaj izlažu na način koji je većinom ili barem dobrim dijelom sličan onome iz ovog udžbenika [1, 2, 6, 9]. Za praćenje sadržaja potrebno je osnovno poznavanje matematičke analize funcija jedne ili više varijabli te linearne algebre, a iako je na početku udžbenika dan pregled osnovnih pojmova koji se koriste, ipak su u popisu literature dodani i neki naslovi na hrvatskom jeziku koji pokrivaju taj sadržaj [4, 7, 8, 10], tako da se zainteresirani čitatelj može podsjetiti ili potražiti pojmove koji nisu spomenuti u tom ipak dosta sažetom pregledu iz uvodnog poglavlja. Ne ubrajajući uvodno poglavlje u kojem je dan pregled osnovnih pojmova, udžbenik je podijeljen na dvije velike cjeline, jedna cjelina se bavi krivuljama, a druga plohama. Poglavlje o krivuljama započinje definiranjem parametrizirane krivulje, pri čemu se uvedu i neki popratni pojmovi i svojstva, a zatim se uvodi Frenetov trobrid koji daje smjerove zakrivljavanja i zasukivanja krivulje. Nakon toga slijedi uvođenje funkcija fleksije i torzije koje daju intenzitet zakrivljavanja i zasukivanja, a sve kulminira fundamentalnim teoremom teorije krivulja koji kaže da je krivulja u potpunosti određena fleksijom i torzijom do na položaj u prostoru. Pri razmatranju ploha također krećemo od definicije parametrizirane plohe, ulogu Frenetovog trobrida kod ploha preuzima tangencijalna ravnina i normala, a za razmatranje daljnjih geometrijskih svojstava ploha ključne su dvije fundamentalne forme, od kojih je prva korisna kod izračunavanja duljine luka krivulje na plohi, kuta između dviju krivulja na plohi i površine omeđenog dijela plohe, dok je druga korisna kod izučavanja zakrivljenosti plohe. Kao i kod krivulja, izlaganje kulminira fundamentalnim teoremom teorije ploha. Osim toga, razmatraju se još i geodetske krivulje na plohi te preslikavanja ploha. Udžbenik je bogato ilustriran slikama, a svi pojmovi su popraćeni primjerima i zadacima koji pomažu kod usvajanja gradiva.
- 1 March 2026
- Published by Faculty of Civil Engineering, Architecture and Geodesy, University of Split
Diferencijalna geometrija
Ovaj udžbenik je nastao na temelju predavanja iz predmeta Diferencijalna geometrija koja držim duži niz godina na prijediplomskom studiju Geodezija i geoinformatika Fakulteta građevinarstva, arhitekture i geodezije u Splitu. Obzirom na to u izlaganju se koristi što je manje moguće složenih matematičkih pojmova kojima studenti tehničkih fakulteta ne vladaju, tako da ga mogu pratiti ne samo studenti studija Geodezija i geoinformatika nego studenti svih tehničkih fakulteta koji su odslušali osnovne matematičke predmete. No, udžbenik je precizno matematički pisan, sa preciznim iskazima i dokazima tvrdnji, tako da posve dobro može poslužiti i kao udžbenik na studiju matematike. Postoji brojna literatura koja se bavi diferencijalnom geometrijom, ali obzirom da se tom sadržaju može pristupiti iz više različitih smjerova, knjige različitih autora mogu se jako razlikovati u načinu izlaganja do razine da se neupućenom čitatelju može činiti da se tu ne radi o istom sadržaju, čak niti sličnom. Zato su ovdje u popisu literature navedene samo neke od knjiga koje sadržaj izlažu na način koji je većinom ili barem dobrim dijelom sličan onome iz ovog udžbenika [1, 2, 6, 9]. Za praćenje sadržaja potrebno je osnovno poznavanje matematičke analize funcija jedne ili više varijabli te linearne algebre, a iako je na početku udžbenika dan pregled osnovnih pojmova koji se koriste, ipak su u popisu literature dodani i neki naslovi na hrvatskom jeziku koji pokrivaju taj sadržaj [4, 7, 8, 10], tako da se zainteresirani čitatelj može podsjetiti ili potražiti pojmove koji nisu spomenuti u tom ipak dosta sažetom pregledu iz uvodnog poglavlja. Ne ubrajajući uvodno poglavlje u kojem je dan pregled osnovnih pojmova, udžbenik je podijeljen na dvije velike cjeline, jedna cjelina se bavi krivuljama, a druga plohama. Poglavlje o krivuljama započinje definiranjem parametrizirane krivulje, pri čemu se uvedu i neki popratni pojmovi i svojstva, a zatim se uvodi Frenetov trobrid koji daje smjerove zakrivljavanja i zasukivanja krivulje. Nakon toga slijedi uvođenje funkcija fleksije i torzije koje daju intenzitet zakrivljavanja i zasukivanja, a sve kulminira fundamentalnim teoremom teorije krivulja koji kaže da je krivulja u potpunosti određena fleksijom i torzijom do na položaj u prostoru. Pri razmatranju ploha također krećemo od definicije parametrizirane plohe, ulogu Frenetovog trobrida kod ploha preuzima tangencijalna ravnina i normala, a za razmatranje daljnjih geometrijskih svojstava ploha ključne su dvije fundamentalne forme, od kojih je prva korisna kod izračunavanja duljine luka krivulje na plohi, kuta između dviju krivulja na plohi i površine omeđenog dijela plohe, dok je druga korisna kod izučavanja zakrivljenosti plohe. Kao i kod krivulja, izlaganje kulminira fundamentalnim teoremom teorije ploha. Osim toga, razmatraju se još i geodetske krivulje na plohi te preslikavanja ploha. Udžbenik je bogato ilustriran slikama, a svi pojmovi su popraćeni primjerima i zadacima koji pomažu kod usvajanja gradiva.
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
Interval index of a graph
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
Interval index of a graph
- Open Access
- 25 November 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 382, 124-136
The σ -irregularity of trees with maximum degree 5
- 25 November 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 382, 124-136
Open AccessThe σ -irregularity of trees with maximum degree 5
- Open Access
- 25 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 509
Invitation to the subpath number
- 25 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 509
Open AccessInvitation to the subpath number
- 4 December 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (2) , 1-19
Domination number of modular product graphs
- 4 December 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (2) , 1-19
Domination number of modular product graphs
- 11 June 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (5) , 1-22
Resolving vertices of graphs with differences
- 11 June 2024
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 43 (5) , 1-22
Resolving vertices of graphs with differences
- 8 December 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 467
Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph
- 8 December 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 467
Normal 5-edge-coloring of some snarks superpositioned by the Petersen graph
- 24 October 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 343, 115-133
Local Irregularity Conjecture vs. cacti
- 24 October 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 343, 115-133
Local Irregularity Conjecture vs. cacti
- Open Access
- 10 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (14) , 2411
Remarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs
The vertex (respectively edge) metric dimension of a graph G is the size of a smallest vertex set in G, which distinguishes all pairs of vertices (respectively edges) in G, and it is denoted by (respectively ). The upper bounds and where denotes the cyclomatic number of G, were established to hold for cacti without leaves distinct from cycles, and moreover, all leafless cacti that attain the bounds were characterized. It was further conjectured that the same bounds hold for general connected graphs without leaves, and this conjecture was supported by showing that the problem reduces to 2-connected graphs. In this paper, we focus on -graphs, as the most simple 2-connected graphs distinct from the cycle, and show that the the upper bound holds for both metric dimensions of -graphs; we characterize all -graphs for which the bound is attained. We conclude by conjecturing that there are no other extremal graphs for the bound in the class of leafless graphs besides already known extremal cacti and extremal -graphs mentioned here.- 10 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (14) , 2411
Open AccessRemarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs
The vertex (respectively edge) metric dimension of a graph G is the size of a smallest vertex set in G, which distinguishes all pairs of vertices (respectively edges) in G, and it is denoted by (respectively ). The upper bounds and where denotes the cyclomatic number of G, were established to hold for cacti without leaves distinct from cycles, and moreover, all leafless cacti that attain the bounds were characterized. It was further conjectured that the same bounds hold for general connected graphs without leaves, and this conjecture was supported by showing that the problem reduces to 2-connected graphs. In this paper, we focus on -graphs, as the most simple 2-connected graphs distinct from the cycle, and show that the the upper bound holds for both metric dimensions of -graphs; we characterize all -graphs for which the bound is attained. We conclude by conjecturing that there are no other extremal graphs for the bound in the class of leafless graphs besides already known extremal cacti and extremal -graphs mentioned here.