Key points are not available for this paper at this time.
Let G be a simple graph with binomial edge ideal JG. We prove how to calculate the multidegree of JG based on combinatorial properties of G. In particular, we study the set S_ (G) defined as the collection of subsets of vertices whose prime ideals have minimum codimension. We provide results which assist in determining S_ (G), then calculate S_ (G) for star, horned complete, barbell, cycle, wheel, and friendship graphs, and use the main result of the paper to obtain the multidegrees of their binomial edge ideals.
Cooper et al. (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: