Št. zadetkov: 108
Objavljeni povzetek znanstvenega prispevka na konferenci
Oznake:
matematika;teorija grafov;uporaba;računalniška omrežja;telekomunikacije;mathematics;graph theory;applications;computer networks;telecommunications;
Some applications of graph theory in computer networks and telecommunications
Leto:
2001
Vir:
Fakulteta za strojništvo (UM FS)
Objavljeni znanstveni prispevek na konferenci
Oznake:
matematika;teorija grafov;krepki produkt grafov;kromatično število;lih cikel;minimalna neodvisna dominantna množica;mathematics;graph theory;strong product;chromatic number;odd cycle;minimal independent dominating set;
The problem of determining the chromatic numbers of the strong product of cycles is considered. A construction is given proving ▫$\chi(G) = 2^p + 1$▫ for a product of ▫$p$▫ odd cycles of lengths at least ▫$2^p + 1$▫. Several consequences are discussed. In particular it is proved that the strong prod ...
Leto:
2002
Vir:
Fakulteta za strojništvo (UM FS)
Izvirni znanstveni članek
Oznake:
matematika;teorija grafov;korekcijske kode;direktni produkt grafov;popolne kode;cikli;mathematics;graph theory;error-correcting codes;direct product of graphs;perfect codes;cycles;
Let ▫$G = \times^n_{i=1}C_{\ell_i}$▫ be a direct product of cycles. It is known that for any ▫$r \le 1$▫, and any ▫$n \le 2▫$, each connected component of ▫$G$▫ contains a so-called canonical ▫$r$▫-perfect code provided that each ▫$\ell_i$▫ is a multiple of ▫$r^n + (r+1)^n$▫. Here we prove that up t ...
Leto:
2008
Vir:
Fakulteta za strojništvo (UM FS)
Poljudni članek
Oznake:
matematika;računalništvo;problem trdnjav;požrešna metoda;
Leto:
1990
Vir:
dLib.si Digitalna knjižnica Slovenije
Video in druga učna gradiva
Oznake:
computer science;data visualisation
Graphs are combinatorial structures given by a set of vertices and a set of edges giving the adjacencies between pairs of vertices. Drawing graphs nicely is a challenging task. If a graph has some particular structure it is often very useful to use the knowledge about this for visualizing the object ...
Leto:
2005
Vir:
videolectures.net
Izvirni znanstveni članek
Oznake:
matematika;kemija;kemijska teorija grafov;molekulski grafi;strukturne formule;topološki indeks;szegedski indeks;algoritmi;mathematics;chemistry;chemical graph theory;molecular graphs;structural formulae;algorithms;topological index;Szeged index;
Dan je algoritem za računanje szegedskega indeksa grafa s časovno zahtevnostjo ▫$O(m,n)$▫, kjer je ▫$n$▫ število točk, ▫$m$▫ pa število povezav.
Leto:
1996
Vir:
Digitalna knjižnica Univerze v Mariboru (DKUM)
Izvirni znanstveni članek
Oznake:
optimization;metaheuristics;local search;greedy construction;traveling salesman problem;
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 be at least considered as one of very natural possi ...
Leto:
2015
Vir:
Digitalna knjižnica Univerze v Mariboru (DKUM)
Izvirni znanstveni članek
Oznake:
generalized Petersen graphs;rainbow domination regular graphs;
Examples of graphs that are rainbow domination regular and not vertex transitive are given. This answers two questions asked in Kuzman (2020). We also characterize all generalized Petersen graphs that are 3-rainbow domination regular.
Leto:
2024
Vir:
Fakulteta za strojništvo (UL FS)
Izvirni znanstveni članek
Oznake:
graph domination;rainbow domination numbers;cubic graphs;generalized Petersen graphs;
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 general lower bounds. As t-rainbow domination of cubic ...
Leto:
2024
Vir:
Fakulteta za strojništvo (UL FS)
Video in druga učna gradiva
Oznake:
definicije;Eulerjevi grafi;Hamiltonovi grafi;drevesa;barvanje grafov;algoritmi;teorija grafov;logistika;učbeniki;
Leto:
2015
Vir:
Fakulteta za logistiko (UM FL)