Premium
Enumeration and generation of a class of regular digraphs
Author(s) -
Ramanath M. V. S.,
Walsh T. R.
Publication year - 1987
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190110404
Subject(s) - mathematics , combinatorics , enumeration , isomorphism (crystallography) , vertex (graph theory) , digraph , class (philosophy) , discrete mathematics , graph , computer science , crystal structure , crystallography , chemistry , artificial intelligence
We study the class of directed graphs that have indegree = outdegree = 2 at every vertex. These digraphs can be decomposed uniquely into “alternating cycles”, we use this decomposition to present efficient techniques for counting and generating them. The number (up to isomorphism) of these digraphs and the number of connected ones on up to 20 vertices have been computed and are presented.