• Publications
  • Influence
Domatic number and degrees of vertices of a graph
  • 66
  • 7
Graphs of semigroups
  • 49
  • 2
The signed edge domination number of a graph is an edge variant of the signed domination number. The closed neighbourhood NG[e] of an edge e in a graph G is the set consisting of e and of all edgesExpand
  • 9
  • 2
Domatic number and linear arboricity of cacti
  • 3
  • 2
Medians and peripherians of trees
  • 111
  • 1
Signed domatic number of a graph
Let G be a finite and simple graph with the vertex set V(G), and let f : V(G) → {-1, 1} be a two-valued function. If ∑x ∈ N[v]f(x) ≥ 1 for each v ∈ V(G), where N[v] is the closed neighborhood of v,Expand
  • 22
  • 1
Signed domination numbers of directed graphs
The concept of signed domination number of an undirected graph (introduced by J. E. Dunbar, S. T. Hedetniemi, M. A. Henning and P. J. Slater) is transferred to directed graphs. Exact values are foundExpand
  • 21
  • 1
Graphs maximal with respect to absence of hamiltonian paths
  • B. Zelinka
  • Computer Science, Mathematics
  • Discuss. Math. Graph Theory
  • 1998
Two classes of graphs which are maximal with respect to the absence of Hamiltonian paths are presented. Block graphs with this property are characterized.
  • 14
  • 1
Connected domatic number of a graph
All graphs considered in this paper are finite graphs without loops and multiple edges. The domatic number of a graph was defined by E. J. Cockayne and S. T. Hedetniemi [1]. Later some relatedExpand
  • 19
  • 1