Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika
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


Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, Number 2, Pages 18–23 (Mi ivm9077)  
This article is cited in 1 scientific paper (total in 1 paper)

T-irreducible extension of polygonal digraphs

A. V. Gavrikov

Chair of Computer Security and Cryptography, Saratov State University, 83 Astrahanskaya str., Saratov, 410012 Russia
Full-text PDF (166 kB) Citations (1)
References:
PDF
HTML
Abstract: Directed graphs are mathematical models of discrete systems. T-irreducible extensions are widely used in cryptography and diagnosis of discrete systems. A polygonal origraph is a digraph obtained from a circuit by some orientation of its edges. We propose an algorithm to construct a T-irreducible extension of a polygonal graph.
Keywords: polygonal graph, fault-tolerance of discrete systems, T-irreducible extension.
Received: 10.07.2014
English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2016, Volume 60, Issue 2, Pages 14–18
DOI: https://doi.org/10.3103/S1066369X16020031
Bibliographic databases:
Document Type: Article
UDC: 519.173
Language: Russian
Citation: A. V. Gavrikov, “T-irreducible extension of polygonal digraphs”, Izv. Vyssh. Uchebn. Zaved. Mat., 2016, no. 2, 18–23; Russian Math. (Iz. VUZ), 60:2 (2016), 14–18
Citation in format AMSBIB
\Bibitem{Gav16}
\by A.~V.~Gavrikov
\paper T-irreducible extension of polygonal digraphs
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 2016
\issue 2
\pages 18--23
\mathnet{http://mi.mathnet.ru/ivm9077}
\transl
\jour Russian Math. (Iz. VUZ)
\yr 2016
\vol 60
\issue 2
\pages 14--18
\crossref{https://doi.org/10.3103/S1066369X16020031}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000409281900003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84955602502}
Linking options:
  • https://www.mathnet.ru/eng/ivm9077
  • https://www.mathnet.ru/eng/ivm/y2016/i2/p18
    • 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
    		Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
    Statistics & downloads:
    Abstract page:153
    Full-text PDF :32
    References:44
    First page:12
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024