Skip to main content
SpringerLink
Log in

Signatures of Extremal 2-Unifrom Hypergraphs

  • COMPUTER METHODS
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

Storing hypergraphs in computer memory is rather inefficient, since the main storage method is an incidence matrix or a list of hyper edges. For n-vertex k-uniform hypergraphs (UHs), it is possible to specify an adjacency matrix but its volume is nk. For extremal UHs, it becomes possible to use the base in the form of a storage object; it takes up less space in memory than a list of hyper edges, but it is not always convenient from a practical point of view. Here we consider a new concept: the signature of an extremal 2-UH, which is a nonnegative integer and uniquely characterizes the hypergraph. For this representation, algorithms are described for constructing an extremal 2-UH in the form of an adjacency matrix or base from a signature. Algorithms for obtaining a signature from an arbitrary adjacency matrix or base of an extremal 2-UH are also presented.

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

Similar content being viewed by others

REFERENCES

  1. G. Póilya, “Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und chemische Verbindungen,” Acta Math. 68, 145–254 (1937).

    Article  MathSciNet  Google Scholar 

  2. E. N. Gilbert, “Enumeration of labelled graphs,” Canad. J. Math. 8, 405–411 (1956).

    Article  MathSciNet  Google Scholar 

  3. A. Nijenhuis and H. S. Wilf, “The enumeration of connected graphs and linked diagrams,” J. Combinat. Theory, Ser. A 27, 356–359 (1979).

    Article  MathSciNet  Google Scholar 

  4. F. Harari and E. Palmer, Graphical Enumeration (Academic, New York, 1973).

    MATH  Google Scholar 

  5. A. A. Mironov, “Uniform generalized graphs,” Dokl. Akad. Nauk 351, 465 (1996).

    MathSciNet  Google Scholar 

  6. H. Prüfer, “Neuer Beweis eines Satzes uber Permutationen,” Arch. Math. Phys. 27, 742–744 (1918).

    MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. A. A. Mironov, Minimax Under Transportation Constraints (Kluwer Acad., Dordrecht, 1999).

    MATH  Google Scholar 

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

    Google Scholar 

  11. V. G. Mokrozub, V. A. Nemtinov, A. S. Mordvin, and A. A. Ilyasov, “Application of n-oriented hypergraphs and relational databases for structural and parametric synthesis of technical systems,” Prikl. Inform., No. 4, 115 (2010).

  12. A. V. Bobu, A. E. Kupriyanov, and A. M. Raigorodskii, “On the number of edges in a uniform hypergraph with a range of permitted intersections,” Probl. Peredachi Inform. 53 (4), 16–42 (2017).

    MATH  Google Scholar 

  13. A. V. Mokryakov and V. I. Tsurkov, “Reconstructing 2-complexes by a nonnegative integer-valued vector,” Autom. Remote Control 72, 2541 (2011).

    Article  MathSciNet  Google Scholar 

  14. A. A. Mironov, “Geometry of points in the space R  n realizable into a graph,” Usp. Mat. Nauk 32, 232–233 (1977).

    MATH  Google Scholar 

  15. 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 (2014).

    Article  MathSciNet  Google Scholar 

Download references

Funding

This study was financially supported by the Russian Foundation for Basic Research (project 21-51-53019 GFEN).

Author information

Authors and Affiliations

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

    T. Yu. Goltsova, E. K. Egorova & A. V. Mokryakov

  2. Kosygin Russian State University, Moscow, Russia

    T. Yu. Goltsova, E. K. Egorova & A. V. Mokryakov

  3. Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, Moscow, Russia

    V. I. Tsurkov

Authors
  1. T. Yu. Goltsova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. K. Egorova
    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

  4. V. I. Tsurkov
    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

Goltsova, T.Y., Egorova, E.K., Mokryakov, A.V. et al. Signatures of Extremal 2-Unifrom Hypergraphs. J. Comput. Syst. Sci. Int. 60, 904–912 (2021). https://doi.org/10.1134/S1064230721060095

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Search

Navigation