The chainable matrix, a special combinatorial matrix

DOI10.1016/0012-365X(75)90049-7zbMath0306.05012MaRDI QIDQ1217808

D. J. Hartfiel, Carlton J. Maxson

Publication date: 1975

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (10)

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

Cites Work

• Parallel concepts in graph theory
• Connectedness of Products of Two Directed Graphs
• Problems Involving Diagonal Products in Nonnegative Matrices
• Unnamed Item

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