Strongly self-dual graphs

DOI10.1016/j.laa.2011.05.010zbMath1226.05170OpenAlexW2058312828MaRDI QIDQ716428

Ryan M. Tifenbach

Publication date: 22 September 2011

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.05.010

zbMATH Keywords

adjacency matrixdual graphunique perfect matchinginverse graph

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Inverses of weighted graphs ⋮ Self-inverse unicyclic graphs and strong reciprocal eigenvalue property ⋮ Self-Dual Maps I: Antipodality ⋮ Partially ordering the class of invertible trees ⋮ On some graphs which satisfy reciprocal eigenvalue properties ⋮ Unnamed Item ⋮ Almost self-inverse graphs

Cites Work

• Unnamed Item
• On unimodular graphs
• Directed intervals and the dual of a graph
• Inverses of trees
• Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching
• On nonsingular trees and a reciprocal eigenvalue property
• On graphs with signed inverses
• The Spectrum of the Corona of Two Graphs

This page was built for publication: Strongly self-dual graphs