Comparing symbolic powers of edge ideals of weighted oriented graphs

Let D be a weighted oriented graph and I(D) be its edge ideal. If D contains an induced odd cycle of length 2n + 1, under certain condition, we show that I(D) ≠ I(D). We give necessary and sufficient condition for the equality of ordinary and symbolic powers of edge ideal of weighted oriented graph having each edge in some induced odd cycle of it. We characterize the weighted naturally oriented unicyclic graphs with unique odd cycles and weighted naturally oriented even cycles for the equality of ordinary and symbolic powers of their edge ideals. Let D be the weighted oriented graph obtained from D after replacing the weights of vertices with non-trivial weights which are sinks, by trivial weights. We show that the symbolic powers of I(D) and I(D) behave in a similar way. Finally, if D is any weighted oriented star graph, we prove that I(D) = I(D) for all s ≥ 2.