Let G = (V (G), E(G)) denote a finite simple (no loops or multiple edges)
undirected
graph with vertices V (G) = {x 1 , . . . , x n } and edge set E(G) . By
identifying the vertices
with the variables in the polynomial ring R = k[x 1 , . . . , x n ] (where
k is a field), we can
associate to each simple graph G a monomial ideal I(G) = ({x i x j |{x i ,
x j } ∈ E(G)})
How to convert graph into ideal in sage ?
Please give some hint.
Thanks in advance
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.
