Raziskovalni matematični seminar - Arhiv
2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 |
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
What is the role of a peer- reviewed journal? Is it to promote scientific inquiry? Is it to serve as an historical repository of a scientific field? Is it an organ of a professional society? Is it to promote an individual scientist by expanding his or her vitae? Is it to observe the flow and direction of research or is it to help direct a research agenda?
There are over 20,000 peer-reviewed journals published each year with more than 1.5 Million papers. A peer-reviewed journal provides a venue for research that demonstrates (or refutes) the efficacy of research -
with its shifting emphasis to new and emerging processes . But, are the journals being flooded with too many papers, many incremental rewrites of previous work? Are reviewers too overworked to provide the depth of
analysis necessary to sort the wheat from the chaff, the real from the hype, especially in terms of what actually improves learning?
Where do the responsibilities lie?
This talk with address these themes in general and draw specific examples from the speaker's nearly 20 years as co-editor of Computers & Education, an International Journal.
Using algebraic approach we show that different domination problems on the class of polygraphs can be solved in constant time. As polygraphs include products of paths and cycles, we implement the algorithm to get some closed expressions for the domination, the independent domination and the Roman domination number of the Cartesian and the direct product of paths and cycles, where the size of one factor is fixed. Additionally we show that the values of the investigated graph invariants on the fasciagraphs and the rotagraphs with the same monograph can only differ for a constant value.
This is a joint work with Janez Žerovnik.
The slides from the talk are available here: DOWNLOAD SLIDES!
In the mid 90’s there were two concurrent and successful programs (one by Dragan Marušič and Raffaele Scapellato and the other led by Cheryl Praeger) to classify vertex-transitive graphs of order a product of two distinct primes. We discuss the complementary results obtained by these efforts, as well as discussing relevant work arising from these classifications. We will also mention some open problems.
Slides from the talk are available here: DOWNLOAD SLIDES!