Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal (Q3205277)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3646947
Language Label Description Also known as
default for all languages
No label defined
    English
    Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal
    scientific article; zbMATH DE number 3646947

      Statements

      Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal (English)
      0 references
      0 references
      1979
      0 references
      square matrix
      0 references
      fully irreducible
      0 references
      irreducibility
      0 references
      directed graph
      0 references
      strongly connected
      0 references
      nonzero transversal
      0 references
      positive diagonal
      0 references
      line graph
      0 references
      bipartite graph
      0 references
      strongly connected polygons
      0 references
      nearly decomposable matrices
      0 references
      cycles
      0 references
      strongly connected graph
      0 references

      Identifiers