20883 research outputs found
Sort by
On cubic vertex-transitive graphs of given girth
No full textA set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs are well known if they are 1-arc-transitive, or if they have two edge orbits and either have girth 3 or vertex-stabilizers of order 1 or 2. There are many results about vertex-transitive cubic graphs of girth 4 with two edge orbits, but for larger girth almost nothing is known about the distinguishing costs of such graphs. We prove that cubic vertex-transitive graphs of girth 5 with two edge orbits have distinguishing cost 2, and prove the non-existence of infinite 3-arc-transitive cubic graphs of girth 6
Vloga socialnega pedagoga pri inkluziji otrok s posebnimi potrebami v redno osnovnošolsko okolje
No full text
Učinki konvergence oči in akomodacije na združevanje vizualnega konteksta med AR »magic-lens« prikazovalnikom in njegovo okolico
No full textPopulation status of Coenonympha oedippus (Lepidoptera: Nymphalidae) and habitat patches in the northwestern part of the Karst near Opatje Selo
No full textSezonske spremembe biomarkerjev oksidativnega stresa (SOD in TBARS) v sredozemski klapavici (Mytilus galloprovincialis, Lamarck, 1819) iz školjčišča
No full textEnhancing crisis response efficiency through ICT
No full textThe potential of information and communication technology (ICT) to improve coordination and decision-making during the training and operational phases of mass casualty incidents (MCIs) has not yet been sufficiently explored. This three-round Delphi study investigates whether ICT use in MCIs can enhance decision-making and increase victim survival rates. The study was conducted from 10 February to 20 September 2024, with 25 international experts from academia, clinical practice, and health informatics. The results were summarised using a SWOT analysis, confirming ICT\u27s perceived potential in MCI management. The analysis revealed a critical asymmetry: while the strengths and opportunities were mainly associated with technical factors (e.g. the effectiveness of drones, global positioning systems, artificial intelligence, dashboards, and virtual and augmented reality to improve the cost-effectiveness of training), weaknesses and threats were mainly social and organisational. These included a lack of standardisation and interoperability, limited ICT-supported training, infrastructure and cybersecurity gaps, resistance to change, legal constraints, underfunding, low technological readiness, and scepticism about the cost-effectiveness of ICT in real-world MCI contexts. Our findings highlight the gap between technological readiness and implementation challenges, suggesting that ICT innovation alone is insufficient without supportive governance, infrastructure, and stakeholder engagement. As the first Delphi study of its kind, it provides a strategic foundation for evidence-based ICT integration in training and operational MCI responses. The findings provide clear priorities for future policy development and empirical validation, emphasising the need to address persistent non-technical barriers to realise ICT’s full potential in crisis management
Štirivalentni razdaljno magični grafi majhnega reda in neskončna družina primerov
No full textA graph of order ▫▫ is distance magic if it admits a bijective labeling of its vertices with integers from ▫▫ to ▫▫ such that each vertex has the same sum of the labels of its neighbors. This paper contributes to the long term project of characterizing all tetravalent distance magic graphs. With the help of a computer we find that out of almost nine million connected tetravalent graphs up to order 16 only nine are distance magic. In fact, besides the six well known wreath graphs there are only three other examples, one of each of the orders 12, 14 and 16. We introduce a generalization of wreath graphs, the so-called quasi wreath graphs, and classify all distance magic graphs among them. This way we obtain infinitely many new tetravalent distance magic graphs. Moreover, the two non-wreath graphs of orders 12 and 14 are quasi wreath graphs while the one of order 16 can be obtained from a quasi wreath graph of order 14 using a simple construction due to Kovář, Fronček and Kovářová