21. Učinek kompleksnosti v okolju korporativnega upravljanja : doktorska disertacijaGregor Žvipelj, 2022, doctoral dissertation Keywords: racionalna nepozornost, pristranskost kompleksnosti, zavajanje z razkritji, moralni hazard, nepravilnost kot posledica asimetrije, informacijska prenasičenost, agencijski problem, učinek kompleksnosti
Published in RUP: 26.08.2022; Views: 2542; Downloads: 144
 Full text (5,11 MB) |
22. |
23. On [plus/minus] 1 eigenvectors of graphsDragan Stevanović, 2016, original scientific article Abstract: 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.
Keywords: eigenvector, adjacency matrix, Wilf's problem
Published in RUP: 03.01.2022; Views: 2357; Downloads: 33
Full text (325,02 KB) |
24. The automorphism groups of non-edge transitive rose window graphsEdward Tauscher Dobson, István Kovács, Štefko Miklavič, 2015, original scientific article Abstract: 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.
Keywords: rose window graphs, automorphism group, isomorphism problem, vertex-transitive graph
Published in RUP: 31.12.2021; Views: 2612; Downloads: 43
Full text (275,74 KB) |
25. |
26. |
27. |
28. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, original scientific article Keywords: 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
Published in RUP: 17.12.2020; Views: 3809; Downloads: 162
 Link to full text |
29. |
30. Strong cliques in diamond-free graphsNina Chiarelli, Berenice Martínez-Barona, Martin Milanič, Jérôme Monnot, Peter Muršič, 2020, published scientific conference contribution Keywords: maximal clique, maximal stable set, diamond-free graph, strong clique, simplicial clique, CIS graph, NP-hard problem, linear-time algorithm, Erdős-Hajnal property
Published in RUP: 10.11.2020; Views: 3258; Downloads: 60
Link to full text |
