We use this notion to give a necessary and sufficient condition for a matrix Y to be fully irreducible without the need to construct a transversal of Y. In ...

Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal. J. Graph Theory 3(2): 151-174 (1979). [j1]. view.

Graph‐theoretic characterization of the matrix property of full irreducibility without using a transversal ... Matrices and Graph Theory · R. P. Tewarson.

Kevorkian. Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal. J. Graph Theory, 3 (1979), pp. 151-174.

Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal. ... graph with no induced claw is hamiltonian ...

Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal. Journal of Graph Theory 3(2): 151-174 · Graph ...

A Graph Theoretic Characterization of the Matrix Property of Full Irreducibility without. Using a Transversal. To appear in J. Graph Theory Vol. 3, No. 2 ...

Furthermore, we say that a matrix M is strongly irreducible provided PM is irreducible for any permutation matrix P. If M is not strongly irreducible, then ...

A Graph Theoretic Characterization of the Matrix Property of Full Irreducibility without Using a Transversal. To appear in J. Graph Theory Vol. 3. No. 2 ...

A simple graph G consists of a non-empty finite set V(G) of elements called vertices. (or nodes), and a finite set E(G) of distinct unordered pairs of distinct ...