1. |
2. Konstrukcije novih superrazredov ukrivljenih funkcij in nadaljnje konstrukcije kriptografsko pomembnih preslikav izven M# : doktorska disertacijaAmar Bapić, 2022, doktorska disertacija Ključne besede: vecotorial bent function, class inclusion, complete Maiorana-McFaralnd class, MNBC functions, secondary constructions, weakly/almost strongly/strongly outside M#, 4-decomposition, SC and CD class, direct and indirect sum Objavljeno v RUP: 12.12.2022; Ogledov: 1094; Prenosov: 12 Povezava na celotno besedilo |
3. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, izvirni znanstveni članek Ključne besede: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, strongly perfect graph, CIS graph, NP-hard problem, polynomial-time algorithm, Erdős-Hajnal property Objavljeno v RUP: 17.12.2020; Ogledov: 1160; Prenosov: 35 Povezava na celotno besedilo |
4. |
5. |
6. |
7. Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groupsŠtefko Miklavič, Primož Šparl, 2012, izvirni znanstveni članek Opis: In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph ▫$\Gamma$▫ is ▫$n$▫-HC-extendable if it contains a path of length ▫$n$▫ and if every such path is contained in some Hamilton cycle of ▫$\Gamma$▫. Similarly, ▫$\Gamma$▫ is weakly ▫$n$▫-HP-extendable if it contains a path of length ▫$n$▫ and if every such path is contained in some Hamilton path of ▫$\Gamma$▫. Moreover, ▫$\Gamma$▫ is strongly ▫$n$▫-HP-extendable if it contains a path of length ▫$n$▫ and if for every such path $P$ there is a Hamilton path of ▫$\Gamma$▫ starting with ▫$P$▫. These concepts are then studied for the class of connected Cayley graphs on abelian groups. It is proved that every connected Cayley graph on an abelian group of order at least three is 2-HC-extendable and a complete classification of 3-HC-extendable connected Cayley graphs of abelian groups is obtained. Moreover, it is proved that every connected Cayley graph on an abelian group of order at least five is weakly 4-HP-extendable. Ključne besede: graph theory, Hamilton cycle, Hamilton path, n-HC-extendable, strongly n-HP-extendable, weakly n-HP-extendable, Cayley graph, abelian group Objavljeno v RUP: 15.10.2013; Ogledov: 2726; Prenosov: 143 Povezava na celotno besedilo |
8. |
9. |