Skip to main content
SpringerLink
Log in

T-irreducible extension of polygonal digraphs

  • Published:
Russian Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bogomolov, A. M., Salii, V. N. Algebraic Base of the Discrete System Theory (Nauka, Moscow, 1997) [in Russian].

    Google Scholar 

  2. Kurnosova, S. G. “T-Irreducible Extensions for Certain Classes of Graphs”, in Theoretical Problems of Information Science and Its Applications, Ed. by A. A. Sytnik (Saratov, Univ. Press, 2004), pp. 113–125 [in Russian].

    Google Scholar 

  3. Kurnosova, S. G. “T-Irreducible Extensions for Complete Binary Trees”, Vestnik Tomsk Gos. Univ., No. 14, 158–160 (2005).[in Russian].

    Google Scholar 

  4. Salii, V. N. “Zero-Knowledge Proof in the Graph Expansion Problems”, Vestnik Tomsk Gos. Univ., No. 6, 63–65 (2003).[in Russian].

    Google Scholar 

  5. Abrosimov, M. B. “Certain Questions onMinimal Graph Extensions”, Saratov Univ Press, Ser.Math.Mech. Information Science 6, No. 1/2, 86–91 (2006).[in Russian].

    Google Scholar 

  6. Hayes, J. P. “A Graph Model for Fault-Tolerant Computing Systems”, IEEE transaction on computer C-26, No. 9, 875–884 (1976).

    Article  Google Scholar 

  7. Abrosimov, M. B. “On the Complexity of Some Problems Related to Graph Extensions”, Math. Notes 88, No. 5, 619–625 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  8. Salii, V. N. “On Ordered Set of a Polygonal Graph Connected Parts”, Saratov Univ. Press 13, No. 2, 44–51 (2013).[in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saratov State University, ul. Astrahanskaya 83, Saratov, 410012, Russia

    A. V. Gavrikov

Authors
  1. A. V. Gavrikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Gavrikov.

Additional information

Original Russian Text © A.V. Gavrikov, 2016, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, No. 2, pp. 18–23.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gavrikov, A.V. T-irreducible extension of polygonal digraphs. Russ Math. 60, 14–18 (2016). https://doi.org/10.3103/S1066369X16020031

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X16020031

Keywords

Search

Navigation