Search
ISSN:
Disciplines
(Field of Science):
- information and communication technology (Engineering and Technology)
- computer and information sciences (Natural sciences)
- 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 |
Model:
Points CiteScore:
| Year | Points |
|---|---|
| Year 2022 | 0.7 |
| Year | Points |
|---|---|
| 2022 | 0.7 |
| 2021 | 0.6 |
| 2020 | 0.4 |
| 2019 | 0.5 |
| 2018 | 0.3 |
| 2017 | 0.3 |
| 2016 | 0.2 |
| 2015 | 0.2 |
| 2014 | 0.2 |
| 2013 | 0.4 |
| 2012 | 0.4 |
| 2011 | 0.5 |
Impact Factor:
Papers published in journal
Filters
total: 2
Catalog Journals
Year 2020
-
On the connected and weakly convex domination numbers
PublicationIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
seen 196 times