arXiv (All)
open access
Spectrally symmetric orientations of graphs
The Hermitian adjacency matrices of digraphs based on the sixth root of unity were introduced in [B. Mohar, A new kind of Hermitian matrices for digraphs, Linear Alg. Appl. (2020)]. They appear to be the most natural choice for the spectral theory of digraphs. Undirected graphs have adjacency spectr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Recursive construction of spectral basis and its application to matrices#1050596
- Spectral Graph Neural Networks with Hermite Polynomials: A Comprehensive Study#1076635
- Degree-based weighted adjacency matrices: spectra, integrality, and edge deletion effects#998133
- Nonlinear spectral graph theory#984843
- The switching conjecture for main eigenvalues is asymptotically true#1063257
Record · ID 997458
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive