Skip to main content
SpringerLink
Log in

Operations over k-Homogeneous Hypergraphs and Their Vectors of the Degrees of the Vertices

  • DISCRETE SYSTEMS
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

The paper considers operations on k-homogeneous hypergraphs and finding the vectors of the degrees of the vertices of the result of the operation without constructing the hypergraphs’ results themselves. It is proposed to express vectors from certain operations in terms of a vector from the intersection of two homogeneous hypergraphs. This will speed up the calculations and simplify the construction of the corresponding vectors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.

Similar content being viewed by others

REFERENCES

  1. A. A. Mironov, Minimax Under Transportation Constraints (Kluwer Academic, Dordrecht, 1999).

    MATH  Google Scholar 

  2. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 1,” J. Comput. Syst. Sci. Int. 33, 107–116 (1995).

    MathSciNet  MATH  Google Scholar 

  3. A. A. Mironov and V. I. Tsurkov, “Network models with fixed parameters at the communication nodes. 2,” J. Comput. Syst. Sci. Int. 32, 1–11 (1994).

    MathSciNet  MATH  Google Scholar 

  4. E. K. Egorova, A. V. Mokryakov, and L. Vang, “Development of hypergraph theory,” J. Comput. Syst. Sci. Int. 57, 109–114 (2018).

    Article  MathSciNet  Google Scholar 

  5. A. A. Zykov, “Hypergraphs,” Usp. Mat. Nauk 29 (6), 89–154 (1974).

    MATH  Google Scholar 

  6. P. S. Aleksandrov, Combinatorial Topology (Gostekhteorizdat, Moscow, 1947) [in Russian].

    Google Scholar 

  7. A. V. Mokryakov, P. S. Selin, and V. I. Tsurkov, Minimax and Vector Recovery in Graphs (Fizmatlit, Moscow, 2017) [in Russian].

    Google Scholar 

  8. A. V. Mokryakov, “Hypergraphs as algebraic structures,” J. Comput. Syst. Sci. Int. 50, 734–740 (2011).

    Article  MathSciNet  Google Scholar 

  9. D. S. Kostyanoi, A. V. Mokryakov, and V. I. Tsurkov, “Hypergraph recovery algorithms from a given vector of vertex degrees,” J. Comput. Syst. Sci. Int. 53, 511–516 (2014).

    Article  MathSciNet  Google Scholar 

Download references

Funding

This work was supported by the Ministry of Science and Higher Education of the Russian Federation, project no. RFMEFI60719X0312.

Author information

Authors and Affiliations

  1. Moscow Aviation Institute (National Research University), 125080, Moscow, Russia

    E. K. Egorova & A. V. Mokryakov

  2. Institute of Informatics Problems, Federal Research Center “Computer Science and Control”, Russian Academy of Sciences, 119333, Moscow, Russia

    A. S. Yesenkov

  3. Kosygin Moscow State University of Design and Technology, 119071, Moscow, Russia

    A. V. Mokryakov

Authors
  1. E. K. Egorova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Yesenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. V. Mokryakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Mokryakov.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Egorova, E.K., Yesenkov, A.S. & Mokryakov, A.V. Operations over k-Homogeneous Hypergraphs and Their Vectors of the Degrees of the Vertices. J. Comput. Syst. Sci. Int. 59, 381–386 (2020). https://doi.org/10.1134/S1064230720030041

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230720030041

Search

Navigation