Counting Series of Undirected Hypergraphs

Huang Ruji

doi:10.13374/j.issn1001-053x.1999.05.053

Volume 21 Issue 5

Aug. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 1999 > 21(5): 507-510

Huang Ruji. Counting Series of Undirected Hypergraphs[J]. Chinese Journal of Engineering, 1999, 21(5): 507-510. doi: 10.13374/j.issn1001-053x.1999.05.053

Citation:

Huang Ruji. Counting Series of Undirected Hypergraphs[J]. Chinese Journal of Engineering, 1999, 21(5): 507-510. doi: 10.13374/j.issn1001-053x.1999.05.053

Huang Ruji. Counting Series of Undirected Hypergraphs[J]. Chinese Journal of Engineering, 1999, 21(5): 507-510. doi: 10.13374/j.issn1001-053x.1999.05.053

Citation:

Huang Ruji. Counting Series of Undirected Hypergraphs[J]. Chinese Journal of Engineering, 1999, 21(5): 507-510. doi: 10.13374/j.issn1001-053x.1999.05.053

PDF( 505 KB)

Counting Series of Undirected Hypergraphs

doi: 10.13374/j.issn1001-053x.1999.05.053

Huang Ruji

Information Engineering School, UST Beijing, Beijing 100083, China

Received Date: 1999-01-13
Available Online: 2021-08-27

Abstract

Abstract

By applying permutation group theory,the concepts of hyperedge group, hypergraph group and hypergraph isomorphism are introduced, and the general expressions of hyperedge group and its cycle index are derived. Then the counting series are derived for undirected unlabeled and labeled hypergraphs, thus the isomorphism and counting problems of undirected hypergraphs are solved.
- hypergraph,
- hyperedge group,
- hypergraph isomorphism,
- counting series