The cyclicity of a hypergraph
This article presents a new generalization of the cyclomatic number of a graph. This is the cyclicity of a hypergraph \(E\), defined as \[ \gamma(E) =\sum_{f: \delta_E(f)>1} \bigl(\delta_E (f)-1\bigr)- \bigl| \text{Max} (E)\bigr |+1, \] where \(\delta_E\) is a notion of `degree' of a subedge \(f\in E\) and \(\text{Max} (E)\) is the set of maximal edges in \(E\). The cyclicity is always nonnegative, equaling 0 only on acyclic hypergraphs, and is monotone increasing on hypergraphs. This paper introduces the notion of the circulant graph \(G\) of a hypergraph \(E\) (essentially, the edges of \(E\) are the vertices of \(G\), and the edges of \(G\) depend on the intersections of the edges of \(E)\), and shows that the cyclicity of \(E\) equals the cyclomatic number of \(G\). The paper concludes with a comparison of cyclicity with the hypergraph cyclomatic number, and also with a few mild generalizations of cyclicity.
- The Euler formula of cyclomatic numbers of hypergraphs
- Graph cyclicity, excess conductance, and resistance deficit
- The upper bound of essential cyclomatic numbers of hypergraphs
- Homology cycles and dependent cycles of hypergraphs
- On acyclic and cyclic hypergraphs
- Cycle-regular graphs
- On a new cyclicity measure of graphs -- the global cyclicity index
- A characterization of hypercacti
- An invariant for hypergraphs
- Hypercycles in a random hypergraph
- Weak edge-degree domination in hypergraphs
- scientific article; zbMATH DE number 3929049 (Why is no real title available?)
- On the failure of fixed-point theorems for chain-complete lattices in the effective topos
- scientific article; zbMATH DE number 1522768 (Why is no real title available?)
- Cyclicity of graphs
- The generalized path matrix and energy
- On some partial line graphs of a hypergraph and the associated matroid
This page was built for publication: The cyclicity of a hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379823)
