The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2019
DOI: 10.13001/1081-3810.3918
|View full text |Cite
|
Sign up to set email alerts
|

On Orthogonal Matrices with Zero Diagonal

Abstract: We consider real orthogonal n × n matrices whose diagonal entries are zero and offdiagonal entries nonzero, which we refer to as OMZD(n). We show that there exists an OMZD(n) if and only if n = 1, 3, and that a symmetric OMZD(n) exists if and only if n is even and n = 4. We also give a construction of OMZD(n) obtained from doubly regular tournaments. Finally, we apply our results to determine the minimum number of distinct eigenvalues of matrices associated with some families of graphs, and consider the relate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
7
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 18 publications
0
7
0
Order By: Relevance
“…For a bipartite graph G with bipartition α ∪ β let B(G) be the set of m × n matrices B, with rows and columns indexed by α and β respectively, such that the (i, j) entry of B is nonzero if and only if i and j ′ are adjacent in G. Let G n denote the graph obtained from the complete bipartite graph K n,n by deleting a perfect matching. Using Lemma 5.10 and Theorem 5.13 the authors of [13] show the following.…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 97%
See 4 more Smart Citations
“…For a bipartite graph G with bipartition α ∪ β let B(G) be the set of m × n matrices B, with rows and columns indexed by α and β respectively, such that the (i, j) entry of B is nonzero if and only if i and j ′ are adjacent in G. Let G n denote the graph obtained from the complete bipartite graph K n,n by deleting a perfect matching. Using Lemma 5.10 and Theorem 5.13 the authors of [13] show the following.…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 97%
“…By Theorem 4.5 we have the following corollary. Recently hollow orthogonal matrices were used in [13] to study the minimum number of distinct eigenvalues of certain families of symmetric matrices. In doing so they used the following construction.…”
Section: Families Of Sign Patterns and Consequences Of The Sippmentioning
confidence: 99%
See 3 more Smart Citations