Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.17278 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913806647558144 |
|---|---|
| author | Raza, Muhammad Ahmed, Obaid Ullah Shabbir, Mudassir Koutsoukos, Xenofon Abbas, Waseem |
| author_facet | Raza, Muhammad Ahmed, Obaid Ullah Shabbir, Mudassir Koutsoukos, Xenofon Abbas, Waseem |
| contents | Let $D$ be an oriented graph with skew adjacency matrix $S(D)$. Two oriented graphs $D$ and $C$ are said to share the same generalized skew spectrum if $S(D)$ and $S(C)$ have the same eigenvalues, and $J-S(D)$ and $J-S(C)$ also have the same eigenvalues, where $J$ is the all-ones matrix. Such graphs that are not isomorphic are generalized cospectral mates. We derive tight upper bounds on the number of non-isomorphic generalized cospectral mates an oriented graph can admit, based on arithmetic criteria involving the determinant of its skew-walk matrix. As a special case, we also provide a criterion for an oriented graph to be weakly determined by its generalized skew spectrum (WDGSS), that is, its only generalized cospectral mate is its transpose. These criteria relate directly to the controllability of graphs, a fundamental concept in the control of networked systems, thereby connecting spectral characterization of graphs to graph controllability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_17278 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Upper Bound on Generalized Cospectral Mates of Oriented Graphs Using Skew-Walk Matrices Raza, Muhammad Ahmed, Obaid Ullah Shabbir, Mudassir Koutsoukos, Xenofon Abbas, Waseem Combinatorics Commutative Algebra 05C50 Let $D$ be an oriented graph with skew adjacency matrix $S(D)$. Two oriented graphs $D$ and $C$ are said to share the same generalized skew spectrum if $S(D)$ and $S(C)$ have the same eigenvalues, and $J-S(D)$ and $J-S(C)$ also have the same eigenvalues, where $J$ is the all-ones matrix. Such graphs that are not isomorphic are generalized cospectral mates. We derive tight upper bounds on the number of non-isomorphic generalized cospectral mates an oriented graph can admit, based on arithmetic criteria involving the determinant of its skew-walk matrix. As a special case, we also provide a criterion for an oriented graph to be weakly determined by its generalized skew spectrum (WDGSS), that is, its only generalized cospectral mate is its transpose. These criteria relate directly to the controllability of graphs, a fundamental concept in the control of networked systems, thereby connecting spectral characterization of graphs to graph controllability. |
| title | An Upper Bound on Generalized Cospectral Mates of Oriented Graphs Using Skew-Walk Matrices |
| topic | Combinatorics Commutative Algebra 05C50 |
| url | https://arxiv.org/abs/2504.17278 |