Local out-tournaments with upset tournament strong components. II: Existence of equal \0,1\-matrix ranks of less than n

MaRDI QIDQ5443175zbMATH OpenFDO

Authors K. A. S. Factor, R. Köhler, Franco Rupcich

Publication date 20 February 2008

Mathematics Subject Classification ID

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

Recommendations

• Local out-tournaments with upset tournament strong components I: full and equal \(\{0,1\}\)-matrix ranks.
• Equal and full \(\{0,1\}\)-matrix ranks of local out-tournaments
• Isolation number versus Boolean rank in tournaments
• scientific article; zbMATH DE number 5016661
• scientific article; zbMATH DE number 436068

Cited in

(4)

• The number of tournaments with the minimum number of upsets
• Local out-tournaments with upset tournament strong components I: full and equal \(\{0,1\}\)-matrix ranks.
• Equal and full \(\{0,1\}\)-matrix ranks of local out-tournaments
• Existence of strict inequalities between the various matrix ranks of tournament matrices

This page was built for publication: Local out-tournaments with upset tournament strong components. II: Existence of equal \(\{0,1\}\)-matrix ranks of less than \(n\)

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