Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
From MaRDI portal
(Redirected from Publication:810045)
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.
Recommendations
Cites work
Cited in
(8)- Enumeration of unlabelled bicolored graphs by degree parities
- On counting limited outdegree grid digraphs and greatest increase grid digraphs
- Bernoulli trials of fixed parity, random and randomly oriented graphs
- scientific article; zbMATH DE number 4152409 (Why is no real title available?)
- Enumeration and generation of a class of regular digraphs
- scientific article; zbMATH DE number 1200181 (Why is no real title available?)
- scientific article; zbMATH DE number 530033 (Why is no real title available?)
- scientific article; zbMATH DE number 743881 (Why is no real title available?)
This page was built for publication: Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810045)