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.
We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan and Weiss (2009). Customers and servers play symmetrical roles.There are finite sets C and S of ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback