Path coverings of graphs and height characteristics of matrices

DOI10.1006/jctb.1993.1063zbMath0794.05078OpenAlexW1988956154MaRDI QIDQ1322029

Hans Schneider, Daniel Hershkowitz

Publication date: 28 August 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9835d2cf237b4901e54a15b4a72c78e8c76b808c

zbMATH Keywords

singular graphtriangular matrixacyclic graphreduced graphgeneric matrixtriangular graphheight characteristicpath coveringssequence of differencesdual sequencesingular \(k\)-pathssingular length

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Canonical forms, reductions, classification (15A21)

Related Items (7)

The relation between the Jordan structure of a matrix and its graph ⋮ Completions of partial Jordan and Hessenberg matrices ⋮ Paths in directed graphs and spectral properties of matrices ⋮ Graph-theoretically determined Jordan-block-size structure of regular matrix pencils ⋮ The combinatorial structure of generalized eigenspaces -- from nonnegative matrices to general matrices ⋮ The height characteristic of block triangular matrices ⋮ Digraph based determination of Jordan block size structure of singular matrix pencils

This page was built for publication: Path coverings of graphs and height characteristics of matrices