Cut-vertices and domination in graphs

Preben Dahl Vestergaard; Bohdan Zelinka

Loading [MathJax]/extensions/MathZoom.js

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Cut-vertices and domination in graphs”

Domination in graphs with few edges

Bohdan Zelinka (1995)

Mathematica Bohemica

Similarity:

The domination number $(G)$ of a graph $G$ and two its variants are considered, namely the signed domination number $_{s} (G)$ and the minus domination number $^{-} (G)$ . These numerical invariants are compared for graphs in which the degrees of vertices do not exceed 3.

Complementarily domatic number of a graph

Bohdan Zelinka (1988)

Mathematica Slovaca

Similarity:

On $k$ -domatic numbers of graphs

Bohdan Zelinka (1983)

Czechoslovak Mathematical Journal

Similarity:

Displaying similar documents to “Cut-vertices and domination in graphs”

Domination in graphs with few edges

Complementarily domatic number of a graph

On k -domatic numbers of graphs

On $k$ -domatic numbers of graphs