Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 6
On the double Roman domination in generalized petersen graphs P(5k,k)
Darja Rupnik Poklukar, Janez Žerovnik
Izvirni znanstveni članek
Oznake: double Roman domination;generalized Petersen graph;discharging method;graph cover;double Roman graph;
A double Roman dominating function on a graph G = (V, E) is a function f : V → {0, 1, 2, 3} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex assigned 3 or at least two vertices assigned 2, and every vertex u with f(u) = 1 is adjacent to at least one ...
Leto: 2022 Vir: Fakulteta za strojništvo (UL FS)
Double Roman domination in generalized Petersen graphs P(ck, k)
Darja Rupnik Poklukar, Janez Žerovnik
Izvirni znanstveni članek
Oznake: dvojna rimska dominacija;posplošeni Petersonovi grafi;pokritja grafov;double Roman domination;generalized Petersen graph;graph cover;
Double Roman domination in generalized Petersen graphs P(ck, k)
Leto: 2022 Vir: Fakulteta za strojništvo (UL FS)
On three-rainbow dominationof generalized Petersen graphs P(ck,k)
Darja Rupnik Poklukar, Janez Žerovnik
Izvirni znanstveni članek
Oznake: dominacija v grafih;mavrična dominacija;posplošeni Petersonovi grafi;singleton rainbow domination;rainbow domination number;generalized Petersen graphs;
Leto: 2022 Vir: Fakulteta za strojništvo (UL FS)
Double Roman domination
Darja Rupnik Poklukar, Janez Žerovnik
Izvirni znanstveni članek
Oznake: dominacija v grafih;dominacijska funkcija;dvojna Rimska dominacija;različice dvojne Rimske dominacije;domination;dominating functions;double Roman domination;variation of double Roman domination;
Since 2016, when the first paper of the double Roman domination appeared, the topic has received considerable attention in the literature. We survey known results on double Roman domination and some variations of the double Roman domination, and a list of open questions and conjectures is provided.
Leto: 2023 Vir: Fakulteta za strojništvo (UL FS)
On vulnerability measures of networks
Rija Erveš, Darja Rupnik Poklukar, Janez Žerovnik
Objavljeni znanstveni prispevek na konferenci
Oznake: diskretna optimizacija;komunikacijsko omrežje;občutljivost za okvare;discrete optimization;communication network;vulnerability;
As links and nodes of interconnection networks are exposed to failures, one of the most important features of a practical networks design is fault tolerance. Vulnerability measures of communication networks are discussed including the connectivities, fault diameters, and measures based on Hosoya- Wi ...
Leto: 2013 Vir: Repozitorij Univerze v Ljubljani (RUL)
Multiple Hungarian method for k-assignment problem
Boštjan Gabrovšek, Tina Novak, Janez Povh, Darja Rupnik Poklukar, Janez Žerovnik
Izvirni znanstveni članek
Oznake: problem k-prirejanja;problem k-ujemanja;hevristični algoritem;lokalno iskanje;požrešni algoritem;Madžarska metoda;k-assignment problem;k-matching problem;heuristic algorithm;local search;greedy algorithm;hungarian method;
The k-assignment problem (or, the k-matching problem) on k-partite graphs is an NP-hard problem for k [greater than or equal to] 3. In this paper we introduce five new heuristics. Two algorithms, Bm and Cm, arise as natural improvements of Algorithm Am from (He et al., in: Graph Algorithms And Appli ...
Leto: 2020 Vir: Fakulteta za strojništvo (UL FS)
Št. zadetkov: 6
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: