ISSN:
eISSN:
Disciplines
(Field of Science):
 Automation, electronic and electrical engineering (Engineering and Technology)
 Information and communication technology (Engineering and Technology)
 Biomedical engineering (Engineering and Technology)
 Management and quality studies (Social studies)
 Computer and information sciences (Natural sciences)
 Mathematics (Natural sciences)
Ministry points: Help
2021  70  Ministry Scored Journals List 2019 
Year  Points  List 

2021  70  Ministry Scored Journals List 2019 
2020  70  Ministry Scored Journals List 2019 
2019  70  Ministry Scored Journals List 2019 
2018  25  A 
2017  25  A 
2016  25  A 
2015  25  A 
2014  20  A 
2013  20  A 
2012  25  A 
2011  25  A 
2010  20  A 
2009  20  A 
2008  20  A 
Model:
Points CiteScore:
2019  2 
Year  Points 

2019  2 
2018  1.8 
2017  2 
2016  2 
2015  2 
2014  1.6 
2013  1.5 
2012  1.6 
2011  1.6 
Impact Factor:
Papers published in journal
Filters
total: 5
Catalog Journals
2021

Secure Italian domination in graphs
PublicationAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
2018

Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as Pcoloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
2016

An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) c(u)c(v)>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{c(u)c(v): uv belongs to E}, is minimal. We show that the problem is NPhard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
2015

Zerovisibility cops and robber and the pathwidth of a graph
PublicationWe examine the zerovisibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zerovisibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...
2007

Packing [1,Delta]factors in graphs of small degree
PublicationRozważano problem znalezienia w grafie zadanej liczby k krawędziowo rozłącznych [1,Delta]faktorów, gdzie Delta oznacza stopień grafu. Problem ten można rozwiązać w czasie liniowym dla k=2, jest on jednak NPtrudny dla każdego k>=3. Pokazano, że wariant minimalizacjny problemu dla k=2 jest NPtrudny dla grafów planarnych podkubicznych, jednak w ogólności istnieje algorytm (42 Delta  30) / (35 Delta  21)  aproksymacyjny.
seen 175 times