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

DOI10.1016/0012-365X(91)90096-KzbMATH Open0733.05043OpenAlexW1972151919WikidataQ114215625 ScholiaQ114215625MaRDI QIDQ810045FDOQ810045

Authors: Shinsei Tazawa, Teruhiro Shirakura, Saburo Tamura 

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

Recommendations

• Enumeration of unlabelled graphs with specified degree parities
• scientific article; zbMATH DE number 861357
• scientific article; zbMATH DE number 969185
• Enumeration of unlabelled bicolored graphs by degree parities
• On the number of labeled acyclic digraphs

zbMATH Keywords

enumerationgenerating functionsdigraphdegreelabelled digraphsunlabelled strict digraphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Enumeration of Locally Restricted Digraphs

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On counting limited outdegree grid digraphs and greatest increase grid digraphs
• Title not available (Why is that?)
• Enumeration of unlabelled bicolored graphs by degree parities
• Bernoulli trials of fixed parity, random and randomly oriented graphs
• Enumeration and generation of a class of regular digraphs

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)