Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

ON SIGNED EDGE DOMINATION NUMBERS OF TREES

- B. Zelinka
- 2002

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 edges… Expand

Signed domatic number of a graph

- L. Volkmann, B. Zelinka
- Computer Science, Mathematics
- Discret. Appl. Math.
- 1 September 2005

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

Signed domination numbers of directed graphs

- B. Zelinka
- Mathematics
- 1 June 2005

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 found… Expand

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.

Connected domatic number of a graph

- B. Zelinka
- Mathematics
- 1986

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 related… Expand

- 19
- 1