Skip to main content
Top
Published in: Journal of Computer and Systems Sciences International 3/2020

01-05-2020 | DISCRETE SYSTEMS

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

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

Published in: Journal of Computer and Systems Sciences International | Issue 3/2020

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference A. A. Mironov, Minimax Under Transportation Constraints (Kluwer Academic, Dordrecht, 1999).MATH A. A. Mironov, Minimax Under Transportation Constraints (Kluwer Academic, Dordrecht, 1999).MATH
2.
go back to reference 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).MathSciNetMATH 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).MathSciNetMATH
3.
go back to reference 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).MathSciNetMATH 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).MathSciNetMATH
4.
go back to reference E. K. Egorova, A. V. Mokryakov, and L. Vang, “Development of hypergraph theory,” J. Comput. Syst. Sci. Int. 57, 109–114 (2018).MathSciNetCrossRef E. K. Egorova, A. V. Mokryakov, and L. Vang, “Development of hypergraph theory,” J. Comput. Syst. Sci. Int. 57, 109–114 (2018).MathSciNetCrossRef
5.
go back to reference A. A. Zykov, “Hypergraphs,” Usp. Mat. Nauk 29 (6), 89–154 (1974).MATH A. A. Zykov, “Hypergraphs,” Usp. Mat. Nauk 29 (6), 89–154 (1974).MATH
6.
go back to reference P. S. Aleksandrov, Combinatorial Topology (Gostekhteorizdat, Moscow, 1947) [in Russian]. P. S. Aleksandrov, Combinatorial Topology (Gostekhteorizdat, Moscow, 1947) [in Russian].
7.
go back to reference A. V. Mokryakov, P. S. Selin, and V. I. Tsurkov, Minimax and Vector Recovery in Graphs (Fizmatlit, Moscow, 2017) [in Russian]. A. V. Mokryakov, P. S. Selin, and V. I. Tsurkov, Minimax and Vector Recovery in Graphs (Fizmatlit, Moscow, 2017) [in Russian].
8.
9.
go back to reference 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).MathSciNetCrossRef 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).MathSciNetCrossRef
Metadata
Title
Operations over k-Homogeneous Hypergraphs and Their Vectors of the Degrees of the Vertices
Authors
E. K. Egorova
A. S. Yesenkov
A. V. Mokryakov
Publication date
01-05-2020
Publisher
Pleiades Publishing
Published in
Journal of Computer and Systems Sciences International / Issue 3/2020
Print ISSN: 1064-2307
Electronic ISSN: 1555-6530
DOI
https://doi.org/10.1134/S1064230720030041

Other articles of this Issue 3/2020

Journal of Computer and Systems Sciences International 3/2020 Go to the issue

Premium Partner