Inverse of the adjacency matrices and strong anti-reciprocal eigenvalue property
DOI10.1080/03081087.2020.1812495zbMath1498.05222OpenAlexW3083880009MaRDI QIDQ5039745
Publication date: 4 October 2022
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2020.1812495
weighted graphperfect matchingalternating pathcorona graphstrong anti-reciprocal eigenvalue property
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Signed and weighted graphs (05C22)
Related Items (2)
Cites Work
- Unnamed Item
- Strong reciprocal eigenvalue property of a class of weighted graphs
- On reciprocal eigenvalue property of weighted trees
- Boolean rings and reciprocal eigenvalue properties
- Graphs with reciprocal eigenvalue properties
- On nonsingular trees and a reciprocal eigenvalue property
- On The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings
- Unicyclic graphs with strong reciprocal eigenvalue property
- A new graph product and its spectrum
- Noncorona graphs with strong anti-reciprocal eigenvalue property
- Class of weighted graphs with strong anti-reciprocal eigenvalue property
This page was built for publication: Inverse of the adjacency matrices and strong anti-reciprocal eigenvalue property