Abstract: A tournament is unimodular if the determinant of its skew-adjacency matrix is . In this paper, we give some properties and constructions of unimodular tournaments. A unimodular tournament with skew-adjacency matrix is invertible if is the skew-adjacency matrix of a tournament. A spectral characterization of invertible tournaments is given. Lastly, we show that every -tournament can be embedded in a unimodular tournament by adding at most vertices.
Recommendations
Cites work
- A matrix description of weakly bipartitive and bipartitive families
- Automorphisms and enumeration of switching classes of tournaments
- Axioms and hulls
- Countable Homogeneous Tournaments
- Determinants of the Tournaments
- Directed intervals and the dual of a graph
- Eigenvalues of graphs and digraphs
- Eigenvalues of symmetric integer matrices
- Every totally real algebraic integer is a tree eigenvalue
- scientific article; zbMATH DE number 3681810 (Why is no real title available?)
- scientific article; zbMATH DE number 3221981 (Why is no real title available?)
- Inverses of trees
- LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT
- On nonsingular trees and a reciprocal eigenvalue property
- On skew-Hadamard matrices
- On unimodular graphs
- Orbits of Permutation Groups on Unordered Sets
- Some \((1, -1)\) matrices
- Two-graphs and skew two-graphs in finite geometries
- Unifying Two Graph Decompositions with Modular Decomposition
Cited in
(5)
This page was built for publication: On unimodular tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2244871)