Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
type: Item
instance of: scholarly article
title: Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree
zbMATH Open document ID: 0733.05043
DOI: 10.1016/0012-365X(91)90096-K
author: Shinsei Tazawa
author: Teruhiro Shirakura
author: Saburo Tamura
published in: Discrete Mathematics
publication date: 1991-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 4212082
zbMATH Keywords: enumeration
zbMATH Keywords: degree
zbMATH Keywords: digraph
zbMATH Keywords: generating functions
zbMATH Keywords: labelled digraphs
zbMATH Keywords: unlabelled strict digraphs
Wikidata QID: Q114215625
reviewed by: Wai-Kai Chen
MaRDI profile type: Publication
cites work: Enumeration of Locally Restricted Digraphs
cites work: Q3835479
full work available at URL: 0012-365x(91)90096-k
OpenAlex ID: W1972151919
description: scientific article; zbMATH DE number 4212082