A note on skew spectrum of graphs
Yanna Wang, Bo Zhou
TL;DR
This paper explores properties of the skew spectrum of graphs, providing insights and addressing a specific open problem related to the skew characteristic polynomial and matching polynomial.
Contribution
It offers new properties of the skew spectrum and resolves a previously open problem about the relationship between skew characteristic and matching polynomials.
Findings
Negative answer to the open problem about skew characteristic and matching polynomials
Properties of the skew spectrum of graphs
Insights into skew-adjacency matrices
Abstract
We give some properties of skew spectrum of a graph, especially, we answer negatively a problem concerning the skew characteristic polynomial and matching polynomial in [M. Cavers et al., Skew-adjacency matrices of graphs, Linear Algebra Appl. 436 (2012) 4512--4529].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Advanced Topics in Algebra