Graph matching remains a core challenge in computer vision, where establishing correspondences between features is crucial for tasks such as object recognition, 3D reconstruction and scene ...

We add a fixed number of vertices of degree 1 to each vertex from one part of a bipartite graph. We study characteristic, matching and some related polynomials for graphs obtained in this way.