2017-02-06 02:22:27 -0500 asked a question weakly-chordal graphs How to get random weakly chordal graphs? 2016-03-01 21:00:16 -0500 received badge ● Popular Question (source) 2016-01-15 01:35:29 -0500 received badge ● Citizen Patrol (source) 2016-01-14 01:41:10 -0500 asked a question co-chordal cover number Definition: A graph $G$ is chordal if every induced cycle in $G$ has length 3, and is co-chordal if the complement graph $G^{c}$ is chordal. The co-chordal cover number, denoted cochord $G$, is the minimum number of co-chordal subgraphs required to cover the edges of G. How to find the cochord($G$) ? Please give some hint Thanks in advance 2016-01-13 00:00:44 -0500 received badge ● Supporter (source) 2016-01-12 13:30:00 -0500 received badge ● Nice Question (source) 2016-01-12 08:31:20 -0500 received badge ● Scholar (source) 2016-01-12 06:51:24 -0500 received badge ● Student (source) 2016-01-12 06:05:36 -0500 asked a question Convert graph into ideal in polynomial ring Let $G = (V (G), E(G))$ denote a finite simple (no loops or multiple edges) undirected graph with vertices $V (G) =\ {x_1 ,\ldots, x_n }$ and edge set $E(G)$ . By identifying the vertices with the variables in the polynomial ring $R = k[x_1 ,\ldots, 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 } \in E(G)})$ How to convert graph into ideal in sage ? Suppose $G$ is cycle graph. can i get ideal with generator $(x_1x_2,x_2x_3,x_3x_4,x_4x_5,x_1x_5)$ in $k[x_1,\ldots ,x_5]$ Please give some hint. Thanks in advance