The P-vertex problem for graphs with perfect matchings

G. Arunkumar, U. S. Jerisha

Sharma and Panda recently proved that every bipartite graph with a perfect matching has property (P); that is, it admits a non-singular real symmetric matrix with support graph G f…