Generating regular directed graphs

被引：5

作者：

Brinkmann, Gunnar ^{[1
]}

机构：

[1] Univ Ghent, B-9000 Ghent, Belgium

来源：

DISCRETE MATHEMATICS | 2013年 / 313卷 / 01期

关键词：

Directed graph; Canonical construction path; Structure generation; Bipartite;

D O I：

10.1016/j.disc.2012.09.014

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2012 Elsevier B.V. All rights reserved.

引用

页码：1 / 7

页数：7

共 8 条

[1]

[Anonymous], 1990, Report TR-CS-90-02

[2]

Berger A, 2010, LECT NOTES COMPUT SC, V6410, P220

[3] Generating water clusters and other directed graphs [J].

Brinkmann, Gunnar .

JOURNAL OF MATHEMATICAL CHEMISTRY, 2009, 46 (04) :1112-1121

[4] Isomorph-free exhaustive generation [J].

McKay, BD .

JOURNAL OF ALGORITHMS, 1998, 26 (02) :306-324

[5]

Meringer M, 1999, J GRAPH THEOR, V30, P137, DOI 10.1002/(SICI)1097-0118(199902)30:2<137::AID-JGT7>3.0.CO

[6]

2-G

[7]

Sloane NJA, The on-line encyclopedia of integer sequences

[8]

[No title captured], DOI 10.1090/dimacs/051/03

← 1 →