Zobrazeno 1 - 10
of 376
pro vyhledávání: '"Žerovnik Janez"'
A $k$-rainbow dominating function ($k$RDF) of $G$ is a function that assigns subsets of $ \{1,2,...,k\}$ to the vertices of $G$ such that for vertices $v$ with $f(v)=\emptyset $ we have $\bigcup\nolimits_{u\in N(v)}f(u)=\{1,2,...,k\}$. The weight $w(
Externí odkaz:
http://arxiv.org/abs/2409.18510
Autor:
Deng Fei, Jiang Huiqin, Liu Jia-Bao, Poklukar Darja Rupnik, Shao Zehui, Wu Pu, Žerovnik Janez
Publikováno v:
Open Chemistry, Vol 17, Iss 1, Pp 448-455 (2019)
The Sanskruti index of a graph G is defined as S(G)=∑uv∈E(G)sG(u)sG(v)sG(u)+sG(v)−23,$$\begin{align*}S(G)=\sum_{uv\in{}E(G)}{\left(\frac{s_G(u)s_G(v)}{s_G(u)+s_G(v)-2}\right)}^3, \end{align*}$$where sG(u) is the sum of the degrees of the neighb
Externí odkaz:
https://doaj.org/article/3c25535212664e628f2efe20ddbe3d40
Autor:
Žerovnik, Janez
The structure of minimal weight rainbow domination functions of cubic graphs are studied. Based on general observations for cubic graphs, generalized Petersen graphs $P(ck,k)$ are characterized whose 4- and 5-rainbow domination numbers equal the gene
Externí odkaz:
http://arxiv.org/abs/2403.07538
Publikováno v:
Business Systems Research, Vol 7, Iss 2, Pp 1-4 (2016)
The special issue of Business Systems Research (SI of BSR) is co-published by the Slovenian Society INFORMATIKA – Section for Operational Research (SSI – SOR) and contains developments and new techniques in operations research (OR) models and the
Externí odkaz:
https://doaj.org/article/baf714d09fcf4505967ab57f22e9ffbb
Autor:
Gabrovšek, Boštjan, Žerovnik, Janez
Petford and Welsh introduced a sequential heuristic algorithm for (approximately) solving the NP-hard graph coloring problem. The algorithm is based on the antivoter model and mimics the behaviour of a physical process based on a multi-particle syste
Externí odkaz:
http://arxiv.org/abs/2309.11961
Autor:
Žerovnik Janez
Publikováno v:
Logistics & Sustainable Transport, Vol 6, Iss 1, Pp 1-10 (2015)
We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should b
Externí odkaz:
https://doaj.org/article/8cd20516bc4b4766a0cf6e2163a0b600
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Novak, Tina, Žerovnik, Janez
The topology of Liouville sets of the real forms of the complex generic Neumann system depends indirectly on the roots of the special polynomial $U_{\cal S}(\lambda)$. For certain polynomials, the existence and positions of the real roots, according
Externí odkaz:
http://arxiv.org/abs/1805.08546