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)

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(10)

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

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)