This article is cited in 1 paper

Assessment of parameters of biregular bipartite graphs

E. A. Schulgina

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: A lower assessment of the number of vertices (t,s)-biregular graphs with the girth 6 at 2 < t < s is proved in this article. Discovered the algorithm of constructing (t,s)-biregular graphs. Proved that the algorithm «(t,s)-constructing» constructs the graph with the girth 6 with certain values t and given values s.

Keywords: Biregular graph, bipartite graph, girth, LDPC-code.