Enumeration of Hypergraphs

descriptionPublicationkeyboard_double_arrow_right Article 01 May 2001 English Publisher:Elsevier BVJournal:European Journal of Combinatorics, volume 22, pages 503-509 (issn: 0195-6698,

Copyright policy )

Authors: Toru Ishihara;

doi: 10.1006/eujc.2001.0498

Enumeration of Hypergraphs

- Summary
- Subjects
- Metrics

Abstract

Formulas for the cycle index of the representation of the symmetric group of degree \(n\) acting on all subsets of the object set are derived and applied through \(n=7\). These can be used to enumerate hypergraphs with Pólya's enumeration theorem. The approach is similar to that of \textit{E. M. Palmer} [Discrete Math. 6, 377-390 (1973; Zbl 0269.05110)] where the focus was on pure hypergraphs.

Related Organizations

University of Tokushima
Japan

Keywords

Computational Theory and Mathematics, Geometry and Topology, Enumeration in graph theory, Hypergraphs, Theoretical Computer Science

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

1

Average

hybrid

Fields of Science (3) View all

Fields of Science