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

DOI10.1016/0012-365X(91)90096-KzbMath0733.05043OpenAlexW1972151919WikidataQ114215625 ScholiaQ114215625MaRDI QIDQ810045

Shinsei Tazawa, Saburo Tamura, Teruhiro Shirakura

Publication date: 1991

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90096-k

zbMATH Keywords

generating functionsdigraphenumerationdegreelabelled digraphsunlabelled strict digraphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Bernoulli trials of fixed parity, random and randomly oriented graphs ⋮ Enumeration of unlabelled bicolored graphs by degree parities

Cites Work

• Enumeration of Locally Restricted Digraphs
• Unnamed Item

This page was built for publication: Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree