Toric Rings of Weighted Oriented Graphs
Given a vertexweighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which depends on the combinatorial structure and weights of the graph. We provide a result analogous to the unweighted, unoriented graph case, to show that when the associated simple graph has only trivial even closed walks, the toric ideal is the zero ideal. Moreover, we give necessary and sufficient conditions for the toric ideal of a weighted oriented graph to be generated by a single binomial and we describe the binomial in terms of the structure of the graph.
Electronic version of an article published as International Journal of Algebra and Computation, 32,(2), 2022, 327345, doi: 10.1142/s0218196722500151, © World Scientific Publishing Company, https://doi.org/10.1142/S0218196722500151
Files
Metadata
Work Title  Toric Rings of Weighted Oriented Graphs 

Access  
Creators 

Keyword 

License  CC BY 4.0 (Attribution) 
Work Type  Article 
Publisher 

Publication Date  February 11, 2022 
Publisher Identifier (DOI) 

Source 

Deposited  May 09, 2022 
Versions
Analytics
Collections
This resource is currently not in any collection.