Title of article
Generating regular directed graphs
Author/Authors
Brinkmann، نويسنده , , Gunnar، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
7
From page
1
To page
7
Abstract
In this article we describe an algorithm to efficiently generate all regular directed graphs for a given number of vertices and given degree. The directed graphs are constructed from regular bipartite (undirected) graphs.
Keywords
directed graph , bipartite , Structure generation , Canonical construction path
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600187
Link To Document