Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree (Q810045)

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.