Inverses of non-bipartite unicyclic graphs with a unique perfect matching
DOI10.1080/03081087.2020.1812496zbMath1498.05223OpenAlexW3084436316MaRDI QIDQ5039746
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.1812496
Trees (05C05) Theory of matrix inversion and generalized inverses (15A09) Paths and cycles (05C38) 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)
Related Items (max. 100)
Cites Work
- Graph invertibility and median eigenvalues
- The Laplacian spectrum of a mixed graph
- Graph invertibility
- On unimodular graphs
- Directed intervals and the dual of a graph
- Inverses of trees
- Inverses of bipartite graphs
- A note on the nullity of unicyclic signed graphs
- Inverses of weighted graphs
- Self-inverse unicyclic graphs and strong reciprocal eigenvalue property
- 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
- On graphs with signed inverses
- Generalized matrix tree theorem for mixed graphs
- The Determinant of the Adjacency Matrix of a Graph
- Which Nonnegative Matrices Are Self-Inverse?
- Unicyclic graphs with bicyclic inverses
- On the inverse and the dual index of a tree
- On some graphs which possess inverses
This page was built for publication: Inverses of non-bipartite unicyclic graphs with a unique perfect matching
