1. |
2. |
3. Učinek kompleksnosti v okolju korporativnega upravljanja : doktorska disertacijaGregor Žvipelj, 2022, doktorska disertacija Ključne besede: racionalna nepozornost, pristranskost kompleksnosti, zavajanje z razkritji, moralni hazard, nepravilnost kot posledica asimetrije, informacijska prenasičenost, agencijski problem, učinek kompleksnosti Objavljeno v RUP: 26.08.2022; Ogledov: 1184; Prenosov: 94 Celotno besedilo (5,11 MB) |
4. |
5. On [plus/minus] 1 eigenvectors of graphsDragan Stevanović, 2016, izvirni znanstveni članek Opis: While discussing his spectral bound on the independence number of a graph, Herbert Wilf asked back in 1986 what kind of a graph admits an eigenvector consisting solely of ▫$\pm 1$▫ entries? We prove that Wilf's problem is NP-complete, but also that the set of graphs having a ▫$\pm 1$▫ eigenvector is quite rich, being closed under a number of different graph compositions. Ključne besede: eigenvector, adjacency matrix, Wilf's problem Objavljeno v RUP: 03.01.2022; Ogledov: 860; Prenosov: 28 Celotno besedilo (325,02 KB) |
6. The automorphism groups of non-edge transitive rose window graphsEdward Dobson, István Kovács, Štefko Miklavič, 2015, izvirni znanstveni članek Opis: In this paper, we determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we determine the isomorphism classes of non-edge-transitive rose window graphs. Ključne besede: rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph Objavljeno v RUP: 31.12.2021; Ogledov: 1085; Prenosov: 20 Celotno besedilo (275,74 KB) |
7. |
8. |
9. |
10. 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: 1431; Prenosov: 54 Povezava na celotno besedilo |