ISSN:
Dyscypliny:
- matematyka (Dziedzina nauk ścisłych i przyrodniczych)
Punkty Ministerialne: Pomoc
Rok | Punkty | Lista |
---|---|---|
Rok 2024 | 40 | Ministerialna lista czasopism punktowanych 2024 |
Rok | Punkty | Lista |
---|---|---|
2024 | 40 | Ministerialna lista czasopism punktowanych 2024 |
2023 | 40 | Lista ministerialna czasopism punktowanych 2023 |
2022 | 40 | Lista ministerialna czasopism punktowanych (2019-2022) |
2021 | 40 | Lista ministerialna czasopism punktowanych (2019-2022) |
2020 | 40 | Lista ministerialna czasopism punktowanych (2019-2022) |
2019 | 40 | Lista ministerialna czasopism punktowanych (2019-2022) |
2018 | 20 | A |
2017 | 20 | A |
2016 | 15 | A |
2015 | 15 | A |
2014 | 20 | A |
2013 | 15 | A |
2012 | 20 | A |
2011 | 20 | A |
2010 | 20 | A |
Model czasopisma:
Punkty CiteScore:
Rok | Punkty |
---|---|
Rok 2023 | 0.8 |
Rok | Punkty |
---|---|
2023 | 0.8 |
2022 | 0 |
2021 | 1.1 |
2020 | 0.8 |
2019 | 0.8 |
2018 | 0.6 |
2017 | 0.6 |
2016 | 0.7 |
2015 | 0.9 |
2014 | 1 |
2013 | 1 |
2012 | 1.3 |
2011 | 1.1 |
Impact Factor:
Prace opublikowane w tym czasopiśmie
Filtry
wszystkich: 2
Katalog Czasopism
Rok 2013
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
Rok 2011
-
Hat problem on odd cycles
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. In this version every player can...
wyświetlono 282 razy