Hilbert series of binomial edge ideals

Let G be a finite simple graph on n vertices and J(G) denote the corresponding binomial edge ideal in the polynomial ring In this article, we compute the Hilbert series of binomial edge ideal of decomposable graphs in terms of Hilbert series of its indecomposable subgraphs. Also, we compute the Hilbert series of binomial edge ideal of join of two graphs and as a consequence we obtain the Hilbert series of complete k-partite graph, fan graph, multi-fan graph and wheel graph.