Construction of simple graphs with given degree partition. (Konstruktion schlichter Graphen mit gegebener Gradpartition.) (German) Zbl 0785.05048

Grund, Roland

Bayreuther Mathematische Schriften 44, 73-104 (1993).

The topic of this paper is the construction of simple graphs with given degree partition. The basic idea is the description of such graphs as orbits of suitable group operations. A practicable algorithm is presented. The effectivity of the algorithm is discussed. E.g. it allows to construct all graphs with 11 vertices subdivided by degree partitions. For shortness all proofs are omitted.

Reviewer: U.Baumann (Dresden)

MSC:

05C25	Graphs and abstract algebra (groups, rings, fields, etc.)
05C85	Graph algorithms (graph-theoretic aspects)
05C50	Graphs and linear algebra (matrices, eigenvalues, etc.)

Keywords:

simple graphs; degree partition; algorithm