A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\)
Publication:2447977
DOI10.1016/j.laa.2014.02.036zbMath1286.05090OpenAlexW1976334269MaRDI QIDQ2447977
Publication date: 29 April 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.02.036
coronaadjacency matrixweighted directed graphgain graphproperty (SN) (strong negation eigenvalue property)property (SR) (strong reciprocal eigenvalue property)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Signed and weighted graphs (05C22)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On reciprocal eigenvalue property of weighted trees
- Spectral properties of complex unit gain graphs
- On weighted directed graphs
- Balance in gain graphs - a spectral analysis
- On a conjecture concerning spanning tree invariants and loop systems
- Biased graphs. I: Bias, balance, and gains
- Biased graphs. II: The three matroids
- Biased graphs IV: Geometrical realizations
- Biased graphs. III: Chromatic and dichromatic invariants
- The size of switching classes with skew gains
- On the corona of two graphs
- On nonsingular trees and a reciprocal eigenvalue property
- Unicyclic graphs with strong reciprocal eigenvalue property
- Location of the eigenvalues of weighted graphs with a cut edge
- The Spectrum of the Corona of Two Graphs
This page was built for publication: A reciprocal eigenvalue property for unicyclic weighted directed graphs with weights from \(\{\pm 1,{\pm}i\}\)