UTILITAS MATHEMATICA - Journal - Bridge of Knowledge

Search

UTILITAS MATHEMATICA

ISSN:

0315-3681

Disciplines
(Field of Science):

  • information and communication technology (Engineering and Technology)
  • mechanical engineering (Engineering and Technology)
  • 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 15 A
2017 15 A
2016 15 A
2015 15 A
2014 15 A
2013 15 A
2012 20 A
2011 20 A
2010 13 A

Model:

Traditional

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2023 0.5
Points CiteScore - previous years
Year Points
2023 0.5
2022 0.5
2021 0.5
2020 0.6
2019 0.5
2018 0.2
2017 0.5
2016 1
2015 1
2014 0.8
2013 0.8
2012 0.5
2011 1

Impact Factor:

Log in to see the Impact Factor.

Filters

total: 3

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2019
  • Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
    Publication

    A team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...

    Full text to download in external service

Year 2015
  • On trees with equal domination and total outer-independent domination numbers
    Publication

    For a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...

Year 2012
  • Double bondage in graphs
    Publication

    A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) 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, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...

    Full text to download in external service

seen 807 times