Search
ISSN:
1526-1719
Disciplines
(Field of Science):
- information and communication technology (Engineering and Technology)
- biomedical engineering (Engineering and Technology)
- computer and information sciences (Natural sciences)
- mathematics (Natural sciences)
(Field of Science)
Ministry points: Help
| Year | Points | List |
|---|---|---|
| Year 2024 | 70 | Ministry scored journals list 2024 |
| Year | Points | List |
|---|---|---|
| 2024 | 70 | Ministry scored journals list 2024 |
| 2023 | 70 | Ministry Scored Journals List |
| 2022 | 70 | Ministry Scored Journals List 2019-2022 |
| 2021 | 70 | Ministry Scored Journals List 2019-2022 |
| 2020 | 70 | Ministry Scored Journals List 2019-2022 |
| 2019 | 70 | Ministry Scored Journals List 2019-2022 |
Model:
Open Access
Points CiteScore:
| Year | Points |
|---|---|
| Year 2023 | 1.2 |
| Year | Points |
|---|---|
| 2023 | 1.2 |
| 2022 | 1 |
| 2021 | 1.6 |
| 2020 | 2 |
| 2019 | 1.8 |
| 2018 | 1.9 |
| 2017 | 1.4 |
| 2016 | 1.6 |
| 2015 | 1.7 |
| 2014 | 1.7 |
| 2013 | 1.4 |
| 2012 | 1.2 |
| 2011 | 1.5 |
Impact Factor:
n/a
Papers published in journal
Filters
total: 1
Catalog Journals
Year 2020
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
seen 505 times