1. Inquiry‑based learning in Grade 9 mathematics : assessing outcomes across Gagné’s taxonomyDaniel Doz, Amalija Žakelj, Mara Cotič, 2025, izvirni znanstveni članek Opis: Inquiry-based learning (IBL) in mathematics is a student-centered approach that encourages exploration, problem-solving, and critical thinking, allowing students to actively engage with mathematical concepts and discover relationships through hands-on activities and collaborative learning. Despite the growing interest in IBL within mathematics education, which has demonstrated the efectiveness of this method on students’ achievements, less is known about its impact on Gagné’s taxonomy of knowledge (conceptual, procedural, and problem-solving knowledge). This study, based on Bruner’s instructional model, compares the efectiveness of IBL against traditional teaching methods in promoting mathematical learning across Gagné’s three taxonomies of knowledge in Grade 9 algebra content, using a sample of 258 Slovenian students (132 in the experimental group). Results show that the experimental group outperformed the control group in most areas, with no signifcant diference observed in procedural knowledge. The study suggests that IBL enhances students’ conceptual understanding and problem-solving abilities by fostering deeper engagement and critical thinking but may not have the same impact on procedural fuency, which requires repetitive practice.
Ključne besede: algebra, equations, inquiry-based learning, mathematics, problem-solving
Objavljeno v RUP: 04.07.2025; Ogledov: 95; Prenosov: 3
 Celotno besedilo (1,09 MB)
Gradivo ima več datotek! Več... |
2. A note on girth-diameter cagesGabriela Araujo-Pardo, Marston D. E. Conder, Natalia García-Colín, György Kiss, Dimitri Leemans, 2025, izvirni znanstveni članek Opis: In this paper we introduce a problem closely related to the Cage Problem and the Degree Diameter Problem. For integers k ≥ 2, g ≥ 3 and d ≥ 1, we define a (k; g, d)-graph to be a k-regular graph with girth g and diameter d. We denote by n₀(k; g, d) the smallest possible order of such a graph, and, if such a graph exists, we call it a (k; g, d)-cage. In particular, we focus on (k; 5, 4)-graphs. We show that n₀(k; 5, 4) ≥ k² + k + 2 for all k, and report on the determination of all (k; 5, 4)-cages for k = 3, 4 and 5 and of examples with k = 6, and describe some examples of (k; 5, 4)-graphs which prove that n₀(k; 5, 4) ≤ 2k² for infinitely many k.
Ključne besede: cages, girth, degree-diameter problem
Objavljeno v RUP: 10.06.2025; Ogledov: 168; Prenosov: 3
Celotno besedilo (378,53 KB)
Gradivo ima več datotek! Več... |
3. |
4. |
5. |
6. |
7. 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: 2014; Prenosov: 120
Celotno besedilo (5,11 MB) |
8. |
9. 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: 1902; Prenosov: 32
Celotno besedilo (325,02 KB) |
10. 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: 1867; Prenosov: 26
Celotno besedilo (275,74 KB) |
