Abstract
Let G be a graph having a unique perfect matching M, be the adjacency matrix of G and be the collection of all positive weight functions defined on the edge set of G in which each weight function w assigns weight 1 to each matching edge and a positive weight to each non-matching edge. The weighted graph satisfies the property if for each eigenvalue of , its anti-reciprocal is also an eigenvalue of with the same multiplicity. In this paper, a class of graphs with a unique perfect matching M for which the diagonal entries of the inverse of the adjacency matrix of each graph are all zero is investigated. Furthermore, it is shown that no noncorona graph in this class satisfies the property even for a single weight function .
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call