101. |
102. |
103. |
104. |
105. |
106. |
107. Objavljanje raziskovalnih podatkov : predstavitev v okviru izobraževanja podatkovnih strokovnjakov, Ljubljana, 14. - 17. 10. 2024Ana Slavec, 2024, other monographs and other completed works Keywords: Nacionalni portal odprte znanosti, odprta znanost, raziskovalni podatki, projekt Spoznaj, načela odprte znanosti, objavljanje raziskovalnih podatkov
Published in DiRROS: 03.03.2025; Views: 81; Downloads: 16
 Full text (7,88 MB) |
108. Načrtovanje in pridobivanje raziskovalnih podatkov : predstavitev v okviru izobraževanja podatkovnih strokovnjakov, Ljubljana, 14. - 17. 10. 2024Ana Slavec, 2024, other monographs and other completed works Keywords: Nacionalni portal odprte znanosti, odprta znanost, raziskovalni podatki, projekt Spoznaj, načela odprte znanosti, pridobivanje raziskovalnih podatkov
Published in DiRROS: 03.03.2025; Views: 94; Downloads: 21
Full text (2,91 MB) |
109. Definicija in življenjski krog raziskovalnih podatkov : predstavitev v okviru izobraževanja podatkovnih strokovnjakov, Ljubljana, 14. - 17. 10. 2024Ana Slavec, 2024, other monographs and other completed works Keywords: Nacionalni portal odprte znanosti, odprta znanost, raziskovalni podatki, projekt Spoznaj, načela odprte znanosti, metapodatki
Published in DiRROS: 03.03.2025; Views: 57; Downloads: 14
Full text (3,93 MB) |
110. Resonance graphs of plane bipartite graphs as daisy cubesSimon Brezovnik, Zhongyuan Che, Niko Tratnik, Petra Žigert Pleteršek, 2025, original scientific article Abstract: We characterize plane bipartite graphs whose resonance graphs are daisy cubes, and therefore generalize related results on resonance graphs of benzenoid graphs, catacondensed even ring systems, as well as $2$-connected outerplane bipartite graphs. Firstly, we prove that if $G$ is a plane elementary bipartite graph other than $K_2$, then the resonance graph of $G$ is a daisy cube if and only if the Fries number of $G$ equals the number of finite faces of $G$. Next, we extend the above characterization from plane elementary bipartite graphs to plane bipartite graphs and show that the resonance graph of a plane bipartite graph $G$ is a daisy cube if and only if $G$ is weakly elementary bipartite such that each of its elementary component $G_i$ other than $K_2$ holds the property that the Fries number of $G_i$ equals the number of finite faces of $G_i$. Along the way, we provide a structural characterization for a plane elementary bipartite graph whose resonance graph is a daisy cube, and show that a Cartesian product graph is a daisy cube if and only if all of its nontrivial factors are daisy cubes.
Keywords: daisy cube, fries number, peripherally 2-colorable, plane (weakly) elementary bipartite graph, resonance graph
Published in DiRROS: 03.03.2025; Views: 63; Downloads: 34
 Full text (646,39 KB)
This document has many files! More... |
