Search
ISSN:
eISSN:
Disciplines
(Field of Science):
- mathematics (Natural sciences)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 40 | Ministry scored journals list 2024 |
| Year | Points | List |
|---|---|---|
| 2024 | 40 | Ministry scored journals list 2024 |
| 2023 | 40 | Ministry Scored Journals List |
| 2022 | 40 | Ministry Scored Journals List 2019-2022 |
| 2021 | 40 | Ministry Scored Journals List 2019-2022 |
| 2020 | 40 | Ministry Scored Journals List 2019-2022 |
| 2019 | 40 | Ministry Scored Journals List 2019-2022 |
| 2018 | 20 | A |
| 2017 | 20 | A |
| 2016 | 20 | A |
| 2015 | 20 | A |
| 2014 | 20 | A |
| 2013 | 20 | A |
| 2012 | 20 | A |
| 2011 | 20 | A |
| 2010 | 20 | A |
Model:
Points CiteScore:
| Year | Points |
|---|---|
| Year 2023 | 0.7 |
| Year | Points |
|---|---|
| 2023 | 0.7 |
| 2022 | 0.9 |
| 2021 | 1 |
| 2020 | 1.1 |
| 2019 | 0.8 |
| 2018 | 0.8 |
| 2017 | 0.7 |
| 2016 | 0.9 |
| 2015 | 0.9 |
| 2014 | 0.7 |
| 2013 | 0.9 |
| 2012 | 0.8 |
| 2011 | 0.9 |
Impact Factor:
Sherpa Romeo:
Papers published in journal
Filters
total: 2
Catalog Journals
Year 2013
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
Year 2012
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
seen 558 times