Operations over k-homogeneous hypergraphs and their vectors of the degrees of the vertices

DOI10.1134/S1064230720030041MaRDI QIDQ786168zbMATH OpenOpenAlexFDO

Authors E. K. Egorova, A. S. Yesenkov, A. V. Mokryakov

Publication date 12 August 2020

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1064230720030041

zbMATH Keywords

symmetric difference

Mathematics Subject Classification ID

Vertex degrees (05C07) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Hypergraph recovery algorithms from a given vector of vertex degrees
• Hypergroups associated with hypergraphs
• Hypergroups constructed from hypergraphs
• On the path hyperoperation and its connections with hypergraph theory
• Homology cycles and dependent cycles of hypergraphs

Cites work

• Development of hypergraph theory
• HYPERGRAPHS
• Hypergraph recovery algorithms from a given vector of vertex degrees
• Hypergraphs as algebraic structures
• Minimax under transportation constraints
• Network models with fixed parameters at the communication nodes. I
• Network models with fixed parameters at the communication nodes. II

Cited in

(3)

• Hypergraph recovery algorithms from a given vector of vertex degrees
• Algorithm of multidimensional data transmission using extremal uniform hypergraphs
• Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs

This page was built for publication: Operations over \(k\)-homogeneous hypergraphs and their vectors of the degrees of the vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786168)