Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


11 - 20 / 175
First pagePrevious page12345678910Next pageLast page
11.
12.
13.
14.
15.
16.
17.
18.
Potovalna navade turistov iz Velike Britanije v Ljubljano : magistrsko delo
David Bunderla, 2021, master's thesis

Keywords: turizem, mestni turizem, britanski turist, Ljubljana, motivi, navade, vtisi
Published in RUP: 20.01.2022; Views: 1449; Downloads: 58
.pdf Full text (1,77 MB)

19.
Some remarks on Balaban and sum-Balaban index
Martin Knor, Jozef Komorník, Riste Škrekovski, Aleksandra Tepeh, 2020, original scientific article

Abstract: In the paper we study maximal values of Balaban and sum-Balaban index, and correct some results appearing in the literature which are only partially correct. Henceforth, we were able to solve a conjecture of M. Aouchiche, G. Caporossi and P. Hansen regarding the comparison of Balaban and Randić index. In addition, we showed that for every k and large enough n, the first k graphs of order n with the largest value of Balaban index are trees. We conclude the paper with a result about the accumulation points of sum-Balaban index.
Keywords: topological index, Balaban index, sum-Balaban index, Randić index
Published in RUP: 03.01.2022; Views: 1012; Downloads: 21
.pdf Full text (310,27 KB)

20.
Relative edge betweenness centrality
Damir Vukičević, Riste Škrekovski, Aleksandra Tepeh, 2017, original scientific article

Abstract: We introduce a new edge centrality measure - relative edge betweenness ▫$\gamma (uv) = b(uv)/\sqrt{c(u)c(v)}$▫, where ▫$b(uv$)▫ is the standard edge betweenness and ▫$c(u)$▫ is the adjusted vertex betweenness. In this alternative definition, the importance of an edge is normalized with respect to the importance of its end-vertices. This gives a better presentation of the ''local'' importance of an edge, i.e. its importance in the near neighborhood. We present sharp upper and lower bounds on this invariant together with the characterization of graphs attaining these bounds. In addition, we discuss the bounds for various interesting graph families, and state several open problems.
Published in RUP: 03.01.2022; Views: 736; Downloads: 15
.pdf Full text (261,26 KB)

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica