A graph is locally irregular if no two adjacent vertices have the same
d...
A matching M in a graph G is semistrong if every edge of M has an
endver...
A conflict-free coloring of a graph with respect to open (resp.,
closed)...
In this paper we consider the question what is the scientific and career...
share