The upper bound of essential cyclomatic numbers of hypergraphs (Q1613566)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The upper bound of essential cyclomatic numbers of hypergraphs |
scientific article; zbMATH DE number 1792481
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The upper bound of essential cyclomatic numbers of hypergraphs |
scientific article; zbMATH DE number 1792481 |
Statements
The upper bound of essential cyclomatic numbers of hypergraphs (English)
0 references
29 August 2002
0 references
In this paper the cyclomatic number in terms of the size, order and edge-size of a hypergraph is studied. The main result gives a general upper bound for the cyclotomic number. Other interesting results are derived from the main theorem.
0 references
0.8114414811134338
0 references
0.8114414811134338
0 references
0.7701041102409363
0 references
0.7680871486663818
0 references
0.7465513348579407
0 references
