Intelligent systems. Theory and applications
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Intelligent systems. Theory and applications:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Intelligent systems. Theory and applications, 2016, Volume 20, Issue 1, Pages 255–263 (Mi ista145)  
This article is cited in 1 scientific paper (total in 1 paper)

Assessment of parameters of biregular bipartite graphs

E. A. Schulgina

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (230 kB) Citations (1)
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.
Document Type: Article
Language: Russian
Citation: E. A. Schulgina, “Assessment of parameters of biregular bipartite graphs”, Intelligent systems. Theory and applications, 20:1 (2016), 255–263
Citation in format AMSBIB
\Bibitem{Sch16}
\by E.~A.~Schulgina
\paper Assessment of parameters of biregular bipartite graphs
\jour Intelligent systems. Theory and applications
\yr 2016
\vol 20
\issue 1
\pages 255--263
\mathnet{http://mi.mathnet.ru/ista145}
Linking options:
  • https://www.mathnet.ru/eng/ista145
  • https://www.mathnet.ru/eng/ista/v20/i1/p255
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Intelligent systems. Theory and applications
    Statistics & downloads:
    Abstract page:66
    Full-text PDF :24
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024