| Title: | Orthogonalisability of joins of graphs |
|---|
| Authors: | ID Levene, Rupert H. (Author)
ID Oblak, Polona (Author)
ID Šmigoc, Helena (Author) |
|---|
| Files: |  PDF - Presentation file, download (870,25 KB)
MD5: C1811183535B2CA9C462F45523FB9965
 URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0024379525002459
|
|---|
| Language: | English |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: |  IMFM - Institute of Mathematics, Physics, and Mechanics
|
|---|
| Abstract: | A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the connected components of two graphs for their join to be orthogonalisable. In some cases, those conditions coincide, and we present several families of joins of graphs that are orthogonalisable. |
|---|
| Keywords: | symmetric matrix, orthogonal matrix, inverse eigenvalue problem, minimum number of distinct eigenvalues, join of graphs |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 01.10.2025 |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | str. 162-181 |
|---|
| Numbering: | Vol. 723 |
|---|
| PID: | 20.500.12556/DiRROS-22926  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 0024-3795 |
|---|
| DOI: | 10.1016/j.laa.2025.06.001 |
|---|
| COBISS.SI-ID: | 239398147 |
|---|
| Publication date in DiRROS: | 08.07.2025 |
|---|
| Views: | 325 |
|---|
| Downloads: | 215 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
