Graph Polynomials and Duality in Graph Theory Publication Trend The graph below shows the total number of publications each year in Graph Polynomials and Duality in Graph Theory.

In addition, recent research in matroid theory has harnessed linear algebraic methods to elucidate relationships among graph invariants, reinforcing the algebraic foundations underlying duality ...

For some bipartite graphs, we prove that the stability region is indeed maximal for any admissible matching policy. For the ML policy, we prove that the stability region is maximal for any bipartite ...

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.

A drawing of a graph G in the plane has the vertices represented by distinct points and the edges represented by polygonal lines joining their endpoints such that: no edge contains a vertex other than ...