Enumeration of labelled digraphs and hypergraphs

We present formulae for the number of labelled k-colored hypergraphs, labelled strongly k-colored hypergraphs, labelled connected hypergraphs, labelled even digraphs and labelled even hypergraphs. We refer to [1] and [2] for the basic definitions. The degree of a vertex v of a hypergraph is the numb...

Full description

Saved in:
Bibliographic Details
Main Authors: Hegde, Malati, Sridharan, M. R.
Format: Book Chapter
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present formulae for the number of labelled k-colored hypergraphs, labelled strongly k-colored hypergraphs, labelled connected hypergraphs, labelled even digraphs and labelled even hypergraphs. We refer to [1] and [2] for the basic definitions. The degree of a vertex v of a hypergraph is the number of edges Ei of H such that v is in Ei. A hypergraph H is even if every vertex of H has even degree. In an even digraph the sum of indegree and outdegree of every vertex is even. R.C. Read [4] has counted the number of k-colored graphs. Here we generalize this result by extending Read’s method to obtain the formula for the number of labelled k-colored and strongly k-colored hypergraphs.
ISSN:0075-8434
1617-9692
DOI:10.1007/BFb0092271