Communications in Combinatorics and Optimization - Journal - Bridge of Knowledge

Search

Communications in Combinatorics and Optimization

ISSN:

2538-2128

Disciplines
(Field of Science):

  • mathematics (Natural sciences)

Ministry points: Help

Ministry points - current year
Year Points List
Year 2024 20 Ministry scored journals list 2024
Ministry points - previous years
Year Points List
2024 20 Ministry scored journals list 2024
2023 20 Ministry Scored Journals List
2022 20 Ministry Scored Journals List 2019-2022
2021 20 Ministry Scored Journals List 2019-2022
2020 20 Ministry Scored Journals List 2019-2022
2019 20 Ministry Scored Journals List 2019-2022
2018 0 unscored
2017 0 unscored
2016 0 unscored
2015 0 unscored
2014 0 unscored
2013 0 unscored

Model:

Open Access

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2023 2.8
Points CiteScore - previous years
Year Points
2023 2.8
2022 2.5
2021 2.5
2020 1.1

Impact Factor:

Log in to see the Impact Factor.

Filters

total: 1

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2016
  • The convex domination subdivision number of a graph
    Publication

    Let G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...

    Full text available to download

seen 686 times