Aleksandra Tepeh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Aleksandra Tepeh has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Riste Škrekovski
University of Ljubljana, FMF, Ljubljana, Slovenia
12 shared publications - Martin Knor
Slovak University of Technology in Bratislava
10 shared publications - Dragana Božović
University of Maribor, FEECS, Maribor, Slovenia
4 shared publications - Iztok Peterin
Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia
4 shared publications - Tadeja Kraner Šumenjak
Faculty of Agriculture and Life Sciences, University of Maribor, Pivola 10, 2311 Hoce, Slovenia
3 shared publications - Gordana Radić
University of Maribor, FEECS, Maribor, Slovenia
2 shared publications
Latest Publications
- Open Access
- 11 September 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 46 (2) , 43
On k-limited domination in graphs
A set of vertices is called a k -limited dominating set if every vertex of the graph is either contained in the set or adjacent to a vertex of the set, and each vertex of the set has at most k neighbors outside the set. The minimum cardinality among all k -limited dominating sets of G is the k-limited domination number , denoted by $$\gamma _k^{\mathrm L}(G)$$ . Since $$\Delta (G)$$ -limited domination coincides with the classical domination, we restrict our attention to the nontrivial range $$1 \le k < \Delta (G)$$ , where the degree limitation becomes meaningful and leads to new combinatorial phenomena. In this paper, we initiate the study of this concept by deriving sharp general bounds for $$\gamma _k^{\mathrm L}(G)$$ and identifying conditions under which these bounds can be further improved. We establish a connection between k -limited domination and (1, t )-domination. In particular, for d -regular graphs we prove that $$\gamma _k^{\mathrm L}(G)=\gamma _{1,d-k}(G)$$ . In the special case $$k=1$$ , we show that 1-limited domination is tightly linked to graph packings, yielding the tight bound $$\gamma ^{\mathrm L}_1(G) \le n - \rho (G)$$ . The study reveals several natural open questions and indicates that limited domination provides a rich ground for further research.- 11 September 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 46 (2) , 43
Open AccessOn k-limited domination in graphs
A set of vertices is called a k -limited dominating set if every vertex of the graph is either contained in the set or adjacent to a vertex of the set, and each vertex of the set has at most k neighbors outside the set. The minimum cardinality among all k -limited dominating sets of G is the k-limited domination number , denoted by $$\gamma _k^{\mathrm L}(G)$$ . Since $$\Delta (G)$$ -limited domination coincides with the classical domination, we restrict our attention to the nontrivial range $$1 \le k < \Delta (G)$$ , where the degree limitation becomes meaningful and leads to new combinatorial phenomena. In this paper, we initiate the study of this concept by deriving sharp general bounds for $$\gamma _k^{\mathrm L}(G)$$ and identifying conditions under which these bounds can be further improved. We establish a connection between k -limited domination and (1, t )-domination. In particular, for d -regular graphs we prove that $$\gamma _k^{\mathrm L}(G)=\gamma _{1,d-k}(G)$$ . In the special case $$k=1$$ , we show that 1-limited domination is tightly linked to graph packings, yielding the tight bound $$\gamma ^{\mathrm L}_1(G) \le n - \rho (G)$$ . The study reveals several natural open questions and indicates that limited domination provides a rich ground for further research. - Open Access
- 19 February 2026
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 49 (2) , 62
On k-Rainbow Total Domination and a Related Conjecture
A k -rainbow total dominating function of a graph G is a function $$f: V(G) \rightarrow 2^{[k]}$$ such that for every vertex $$v \in V(G)$$ with $$f(v) = \emptyset $$ , the union of the colors assigned to its neighbors equals [ k ], and if $$f(v) = \{i\}$$ , then v has a neighbor u with $$i \in f(u)$$ . The minimum weight of such a function is called the k -rainbow total domination number of G and is denoted by $$\gamma _{k\textrm{rt}}(G)$$ . We contribute to the study of k -rainbow total domination by proving one conjecture and constructing a counterexample to another. First, we show that the problem of determining whether a graph admits a k -rainbow total dominating function of a given weight is NP-complete. In the second part, we derive an upper bound on the domination number of a graph G in terms of $$\gamma _{k\textrm{rt}}(G)$$ and the frequency of the least-used color in a k -rainbow total dominating function. This result not only provides an alternative and shorter proof of a known lower bound on $$\gamma _{k\textrm{rt}}(G)/\gamma (G)$$ , originally established by Ojakian et al. (2021), but also contributes to disproving their conjecture on the lower bound for $$\gamma _{k\textrm{rt}}(G)$$ when $$k= 4$$ .- 19 February 2026
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 49 (2) , 62
Open AccessOn k-Rainbow Total Domination and a Related Conjecture
A k -rainbow total dominating function of a graph G is a function $$f: V(G) \rightarrow 2^{[k]}$$ such that for every vertex $$v \in V(G)$$ with $$f(v) = \emptyset $$ , the union of the colors assigned to its neighbors equals [ k ], and if $$f(v) = \{i\}$$ , then v has a neighbor u with $$i \in f(u)$$ . The minimum weight of such a function is called the k -rainbow total domination number of G and is denoted by $$\gamma _{k\textrm{rt}}(G)$$ . We contribute to the study of k -rainbow total domination by proving one conjecture and constructing a counterexample to another. First, we show that the problem of determining whether a graph admits a k -rainbow total dominating function of a given weight is NP-complete. In the second part, we derive an upper bound on the domination number of a graph G in terms of $$\gamma _{k\textrm{rt}}(G)$$ and the frequency of the least-used color in a k -rainbow total dominating function. This result not only provides an alternative and shorter proof of a known lower bound on $$\gamma _{k\textrm{rt}}(G)/\gamma (G)$$ , originally established by Ojakian et al. (2021), but also contributes to disproving their conjecture on the lower bound for $$\gamma _{k\textrm{rt}}(G)$$ when $$k= 4$$ . - Open Access
- 21 January 2026
- Published by University of Maribor
Vodnik skozi postopke pri analizi ankete s statističnim programom SPSS: 1. del: Priprava ankete in podatkovne datoteke
Publikacija Vodnik skozi postopke pri analizi ankete s statističnim programom SPSS – 1. del je praktično naravnan učni pripomoček, namenjen začetnim uporabnikom statističnega programa SPSS. Osredotoča se na prve, pogosto spregledane korake raziskovalnega procesa, ki potekajo še pred samo analizo podatkov: razumevanje statističnih enot in spremenljivk, načrtovanje raziskave, oblikovanje anketnega vprašalnika ter pripravo podatkovne datoteke. Bralca korak za korakom vodi skozi sestavo ankete, kodiranje in urejanje spremenljivk, uvoz in organizacijo podatkov ter osnovne funkcionalnosti okolja. Poseben poudarek namenja jasnim razlagam, preglednim primerom in praktičnim nasvetom, ki bralcu pomagajo vzpostaviti zanesljivo podatkovno osnovo za nadaljnje statistične analize. Publikacija je zasnovana kot praktičen pripomoček za uporabnike, ki pri delu s podatki potrebujejo jasna in uporabna navodila za uporabo programa SPSS.
- 21 January 2026
- Published by University of Maribor
Open AccessVodnik skozi postopke pri analizi ankete s statističnim programom SPSS: 1. del: Priprava ankete in podatkovne datoteke
Publikacija Vodnik skozi postopke pri analizi ankete s statističnim programom SPSS – 1. del je praktično naravnan učni pripomoček, namenjen začetnim uporabnikom statističnega programa SPSS. Osredotoča se na prve, pogosto spregledane korake raziskovalnega procesa, ki potekajo še pred samo analizo podatkov: razumevanje statističnih enot in spremenljivk, načrtovanje raziskave, oblikovanje anketnega vprašalnika ter pripravo podatkovne datoteke. Bralca korak za korakom vodi skozi sestavo ankete, kodiranje in urejanje spremenljivk, uvoz in organizacijo podatkov ter osnovne funkcionalnosti okolja. Poseben poudarek namenja jasnim razlagam, preglednim primerom in praktičnim nasvetom, ki bralcu pomagajo vzpostaviti zanesljivo podatkovno osnovo za nadaljnje statistične analize. Publikacija je zasnovana kot praktičen pripomoček za uporabnike, ki pri delu s podatki potrebujejo jasna in uporabna navodila za uporabo programa SPSS.
- Open Access
- 31 August 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 510
Induced cycles vertex number and (1,2)-domination in cubic graphs
- 31 August 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 510
Open AccessInduced cycles vertex number and (1,2)-domination in cubic graphs
- Open Access
- 11 April 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (5) , 1-13
2-rainbow independent domination in complementary prisms
A function f that assigns values from the set $$\{0, 1, 2\}$$ to each vertex of a graph G is called a 2-rainbow independent dominating function, if the vertices assigned the value 1 form an independent set, the vertices assigned the value 2 form another independent set, and every vertex to which 0 is assigned has at least one neighbor in each of the mentioned independent sets. The weight of this function is the total number of vertices assigned nonzero values. The 2-rainbow independent domination number of G, $$\gamma _{\textrm{ri}2}(G)$$ , is the minimum weight of such a function. Motivated by a real-life application, we study the 2-rainbow independent domination number of the complementary prism $$G \overline{G}$$ of a graph G, which is constructed by taking G and its complement $$\overline{G}$$ , and then adding edges between corresponding vertices. We provide tight bounds for $$\gamma _{\textrm{ri}2}(G\overline{G})$$ , and characterize graphs for which the lower bound, i.e. $$\max \{\gamma _{\textrm{ri}2}(G), \gamma _{\textrm{ri}2}(\overline{G})\}+1$$ , is attained. The obtained results can, in practice, enable the prediction of the cost estimate for a given communication or surveillance network.- 11 April 2025
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 44 (5) , 1-13
Open Access2-rainbow independent domination in complementary prisms
A function f that assigns values from the set $$\{0, 1, 2\}$$ to each vertex of a graph G is called a 2-rainbow independent dominating function, if the vertices assigned the value 1 form an independent set, the vertices assigned the value 2 form another independent set, and every vertex to which 0 is assigned has at least one neighbor in each of the mentioned independent sets. The weight of this function is the total number of vertices assigned nonzero values. The 2-rainbow independent domination number of G, $$\gamma _{\textrm{ri}2}(G)$$ , is the minimum weight of such a function. Motivated by a real-life application, we study the 2-rainbow independent domination number of the complementary prism $$G \overline{G}$$ of a graph G, which is constructed by taking G and its complement $$\overline{G}$$ , and then adding edges between corresponding vertices. We provide tight bounds for $$\gamma _{\textrm{ri}2}(G\overline{G})$$ , and characterize graphs for which the lower bound, i.e. $$\max \{\gamma _{\textrm{ri}2}(G), \gamma _{\textrm{ri}2}(\overline{G})\}+1$$ , is attained. The obtained results can, in practice, enable the prediction of the cost estimate for a given communication or surveillance network. - Open Access
- 29 September 2024
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 24 (4) , #P4.07
Selected topics on Wiener index
AMC is a journal published by University of Primorska.
- 29 September 2024
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 24 (4) , #P4.07
Open AccessSelected topics on Wiener index
AMC is a journal published by University of Primorska.
- Open Access
- 8 August 2024
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 47 (5) , 1-12
Complexity of 2-Rainbow Total Domination Problem
In this paper, we extend the findings of recent studies on k-rainbow total domination by placing our focus on its computational complexity aspects. We show that the problem of determining whether a graph has a 2-rainbow total dominating function of a given weight is NP-complete. This complexity result holds even when restricted to planar graphs. Along the way tight bounds for the k-rainbow total domination number of rooted product graphs are established. In addition, we obtain the closed formula for the k-rainbow total domination number of the corona product $$G*H$$ , provided that H has enough vertices.- 8 August 2024
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 47 (5) , 1-12
Open AccessComplexity of 2-Rainbow Total Domination Problem
In this paper, we extend the findings of recent studies on k-rainbow total domination by placing our focus on its computational complexity aspects. We show that the problem of determining whether a graph has a 2-rainbow total dominating function of a given weight is NP-complete. This complexity result holds even when restricted to planar graphs. Along the way tight bounds for the k-rainbow total domination number of rooted product graphs are established. In addition, we obtain the closed formula for the k-rainbow total domination number of the corona product $$G*H$$ , provided that H has enough vertices. - Open Access
- 3 April 2024
- Published by University of Maribor
Kvizi iz Matematike I: 2. del
Pričujoča zbirka rešenih nalog je učni pripomoček, v prvi vrsti namenjen študentom 1. letnika visokošolskih študijskih programov Računalništvo in informacijske tehnologije in Informatika in tehnologije komuniciranja na UM FERI, ki poslušajo predmet Matematika 1. Ker večina naravoslovnih in tehniških študijskih smeri drugih fakultet v prvem letniku pokriva enako snov, je tako namenjen tudi širši publiki. Prvi del zbirke pokriva teme iz osnov logičnega sklepanja, množice, kompleksnih števil in funkcij. V tem (drugem) delu zbirke so obravnavane limite, odvodi, integrali, zaporedja in vrste. Zbirka kot celota študenta nagovori k pripravi dobrih zapiskov, kar je eden izmed temeljev dobre priprave na izpite.
- 3 April 2024
- Published by University of Maribor
Open AccessKvizi iz Matematike I: 2. del
Pričujoča zbirka rešenih nalog je učni pripomoček, v prvi vrsti namenjen študentom 1. letnika visokošolskih študijskih programov Računalništvo in informacijske tehnologije in Informatika in tehnologije komuniciranja na UM FERI, ki poslušajo predmet Matematika 1. Ker večina naravoslovnih in tehniških študijskih smeri drugih fakultet v prvem letniku pokriva enako snov, je tako namenjen tudi širši publiki. Prvi del zbirke pokriva teme iz osnov logičnega sklepanja, množice, kompleksnih števil in funkcij. V tem (drugem) delu zbirke so obravnavane limite, odvodi, integrali, zaporedja in vrste. Zbirka kot celota študenta nagovori k pripravi dobrih zapiskov, kar je eden izmed temeljev dobre priprave na izpite.
- Open Access
Selected topics on Wiener index
The Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, which is on the other hand still a very active area of research. This work presents a natural continuation of the paper Mathematical aspects of Wiener index (Ars Math. Contemp., 2016) in which several interesting open questions on the topic were outlined. Here we collect answers gathered so far, give further insights on the topic of extremal values of Wiener index in different settings, and present further intriguing problems and conjectures.
Open AccessSelected topics on Wiener index
The Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, which is on the other hand still a very active area of research. This work presents a natural continuation of the paper Mathematical aspects of Wiener index (Ars Math. Contemp., 2016) in which several interesting open questions on the topic were outlined. Here we collect answers gathered so far, give further insights on the topic of extremal values of Wiener index in different settings, and present further intriguing problems and conjectures.
- Open Access
- 1 January 2022
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 16 (1) , 132-145
3-path vertex cover and dissociation number of hexagonal graphs
A subset P of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from P. The cardinality of a minimum k-path vertex cover is called the k-path vertex cover number of G, and is denoted by ψk(G). It is known that the problem of finding a minimum 3-path vertex cover is NP-hard for planar graphs. In this paper we establish an upper bound for ψ3(G), where G is from an important family of planar graphs, called hexagonal graphs, arising from real world applications.
- 1 January 2022
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 16 (1) , 132-145
Open Access3-path vertex cover and dissociation number of hexagonal graphs
A subset P of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from P. The cardinality of a minimum k-path vertex cover is called the k-path vertex cover number of G, and is denoted by ψk(G). It is known that the problem of finding a minimum 3-path vertex cover is NP-hard for planar graphs. In this paper we establish an upper bound for ψ3(G), where G is from an important family of planar graphs, called hexagonal graphs, arising from real world applications.