Prikladnaya Diskretnaya Matematika. Supplement
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



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






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


Prikladnaya Diskretnaya Matematika. Supplement, 2013, Issue 6, Pages 80–81 (Mi pdma97)  

Applied graph theory

Functional graph trees for circulants with linear Boolean functions at the vertices

A. S. Kornienko

Novosibirsk State University
References:
Abstract: The functional graph of a discrete dynamic system being a model of regulatory gene network circuit is defined as the graph of the transformation $A_{f,2}:F_{2}^{n}\rightarrow F_{2}^{n}$ where $A_{f,2}(v_0,v_1,\ldots,v_{n-1}) = (u_0,u_1,\ldots,u_{n-1})$, $u_i=v_{i-1}+v_i+v_{i+1}$, $i=0,1,\ldots,n-1$, $v_{-1}=v_{n-1}$, $v_n=v_0$. The structure of this graph is completely described.
Keywords: discrete dynamical system, circulant, gene network, regulatory circuit, functional graph.
Document Type: Article
UDC: 519.174
Language: Russian
Citation: A. S. Kornienko, “Functional graph trees for circulants with linear Boolean functions at the vertices”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 80–81
Citation in format AMSBIB
\Bibitem{Kor13}
\by A.~S.~Kornienko
\paper Functional graph trees for circulants with linear Boolean functions at the vertices
\jour Prikl. Diskr. Mat. Suppl.
\yr 2013
\issue 6
\pages 80--81
\mathnet{http://mi.mathnet.ru/pdma97}
Linking options:
  • https://www.mathnet.ru/eng/pdma97
  • https://www.mathnet.ru/eng/pdma/y2013/i6/p80
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:197
    Full-text PDF :58
    References:35
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024