Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree (Q810045)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree |
scientific article; zbMATH DE number 4212082
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree |
scientific article; zbMATH DE number 4212082 |
Statements
Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree (English)
0 references
1991
0 references
A digraph of order p with a odd out-vertices, b odd in-vertices and k specified loopless vertices is called a (p,a,b,k)-digraph. A (p,a,b,p)- digraph is said to be strict. The paper gives the ordinary generating functions for labelled digraphs and unlabelled strict digraphs with given numbers of odd out-vertices and odd in-vertices.
0 references
enumeration
0 references
degree
0 references
digraph
0 references
generating functions
0 references
labelled digraphs
0 references
unlabelled strict digraphs
0 references
