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

DOI10.1002/jgt.3190030207zbMath0416.05058OpenAlexW4234665077MaRDI QIDQ3205277

Aram K. Kevorkian

Publication date: 1979

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190030207

zbMATH Keywords

bipartite graphcyclesdirected graphline graphirreducibilitysquare matrixstrongly connectednearly decomposable matricesstrongly connected graphpositive diagonalfully irreduciblenonzero transversalstrongly connected polygons

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Handle bases and bounds on the number of subgraphs

Cites Work

• A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues

This page was built for publication: Graph-theoretic characterization of the matrix property of full irreducibility without using a transversal