### Methods for finding minimal primitive extensions of directed graphs

#### Abstract

*O*(

*m*), where

*m*is the number of arcs in the graph.

#### Full Text:

PDF (Russian)#### References

Bogomolov A.M., Salii V.N. Algebraicheskie osnovy teorii diskretnykh sistem. M.: Nauka 1997.

Frobenius G. Über Matrizen aus nicht negativen Elementen // Sitzungsber. Preuß. Akad. Wiss., Berlin, 1912. P. 456–477.

Wielandt H. Unzerlegbare nicht negative Matrizen // Math. Zeitschr. 1950. V. 52. P. 642–648.

Fomichev V.M. Otsenki eksponentov primitivnykh grafov // Prikladnaia diskretnaia matematika. 2011. №2(12). S. 101–112.

Fomichev V.M. O stepennoi strukture grafov // Prikladnaia diskretnaia matematika, 2015, №8. S. 20–22.

Fomichev V.M. Svoistva minimal'nykh primitivnykh orgrafov // Prikladnaia diskretnaia matematika. 2015. №2(28). S. 86–96.

Salii V.N. Minimal'nye primitivnye rasshireniia orientirovannykh grafov. // Prikladnaia diskretnaia matematika. 2008. C. 116-119.

Dulmage A.L., Mendelsohn N.S. The exponent of a primitive matrix // Canad. Math. Bull. 1963. Vol. 5, № 3. P. 241–244.

Brualdi R., Ryser H. Combinatorial Matrix Theory. Cambridge University Press, New York, 1991.

Sachkov V.N., Tarakanov V.E. Kombinatorika neotritsatel'nykh matrits. M.: TVP, 2000.

### Refbacks

- There are currently no refbacks.

Abava Кибербезопасность MoNeTec 2024

ISSN: 2307-8162