Directed intervals and the dual of a graph

DOI10.1016/j.laa.2009.03.032zbMath1226.05171OpenAlexW2041004354MaRDI QIDQ1030742

Stephen J. Kirkland, Ryan M. Tifenbach

Publication date: 2 July 2009

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

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

zbMATH Keywords

adjacency matrixunicyclic graphdual 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 (13)

Inverses of non-bipartite unicyclic graphs with a unique perfect matching ⋮ On the inverse of unicyclic 3-coloured digraphs ⋮ Inverses of weighted graphs ⋮ On a construction of integrally invertible graphs and their spectral properties ⋮ Self-inverse unicyclic graphs and strong reciprocal eigenvalue property ⋮ On unicyclic non-bipartite graphs with tricyclic inverses ⋮ Unnamed Item ⋮ On the Moore-Penrose pseudo-inversion of block symmetric matrices and its application in the graph theory ⋮ On unimodular tournaments ⋮ On some graphs which possess inverses ⋮ Strongly self-dual graphs ⋮ Graph invertibility ⋮ Almost self-inverse graphs

Cites Work

• Unnamed Item
• On unimodular graphs
• 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
• On the inverse and the dual index of a tree

This page was built for publication: Directed intervals and the dual of a graph