The chainable matrix, a special combinatorial matrix

DOI10.1016/0012-365X(75)90049-7MaRDI QIDQ1217808zbMATH OpenFDO

Authors Darald J. Hartfiel, C. J. Maxson

Publication date 1975

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(75)90049-7

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Directed graphs (digraphs), tournaments (05C20)

Cites work

• Connectedness of Products of Two Directed Graphs
• scientific article; zbMATH DE number 3588376 (Why is no real title available?)
• Parallel concepts in graph theory
• Problems Involving Diagonal Products in Nonnegative Matrices

Cited in

(13)

• A sharpened condition for strict log-convexity of the spectral radius via the bipartite graph
• Nonnegative chainable matrices
• Nonnegative chainable matrices and Kolmogorov's condition
• Weak connectedness of tensor product of digraphs
• Digraphs products
• Arbitrarily regularizable graphs
• Matrix patterns for eigenvalue—eigenvector Adjustment
• Diagonal Scalings for the Eigenstructure of Arbitrary Pencils
• An upper bound for the chainable index
• Frobenius and Sylvester inequalities for the chainable rank
• Algebraically chainable matrices and their properties
• Linear bijective maps preserving the chainable index
• The number of connected components in a graph associated with a rectangular (0,1)-matrix

This page was built for publication: The chainable matrix, a special combinatorial matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1217808)