Displaying 521 – 540 of 584

Showing per page

Total edge-domatic number of a graph

Bohdan Zelinka (1991)

Mathematica Bohemica

The total edge-domatic number of a graph is introduced as an edge analogue of the total domatic number. Its values are studied for some special classes of graphs. The concept of totally edge-domatically full graph is introduced and investigated.

Two operations of merging and splitting components in a chain graph

Milan Studený, Alberto Roverato, Šárka Štěpánová (2009)

Kybernetika

In this paper we study two operations of merging components in a chain graph, which appear to be elementary operations yielding an equivalent graph in the respective sense. At first, we recall basic results on the operation of feasible merging components, which is related to classic LWF (Lauritzen, Wermuth and Frydenberg) Markov equivalence of chain graphs. These results are used to get a graphical characterisation of factorisation equivalence of classic chain graphs. As another example of the use...

Über den Umriss der konvexen Flächen

Václav Medek (1978)

Aplikace matematiky

In dem Artikel is eine Methode zur Konstruktion des Umrisses eines konvexen Gebildes beschrieben, die für automatische Bearbeitung geeignet ist.

Currently displaying 521 – 540 of 584