[sage-support] 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 , . . . , 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

[sage-support] Relabel vertices

Suppose I want to draw the graph. Coding is sage: d={1:[2,3],2:[3]} sage: g=Graph(d) sage: g.show() Launched png viewer for Graphics object consisting of 7 graphics primitives Can i change the relabel vertices? For example: V(G)={x_1,x_2,x_3} -- You received this message because you are subscr

[sage-support] maximum induced cycle length

Is there any coding/command, to find maximum induced cycle length? -- 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 sage-support+unsubscr...@googlegroups.com. To

[sage-support] How to find the simplicial complex (Independence complex) corresponding to monomial ideal?

How to find the simplicial complex (Independence complex) corresponding to monomial ideal? -- 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 sage-support+unsubs

[sage-support] Induced matching number

*Definition:* A matching in a graph G is a subgraph consisting of pairwise disjoint edges. If the subgraph is an induced subgraph, the matching is an induced matching. Induced matching number of G is the maximum size of induced matching of G. How to calculate induced matching number? Please gi

[sage-support] Cartesian product of graph

Let G,H be graphs and G*H denoted by Cartesian product see[ https://en.wikipedia.org/wiki/Cartesian_product_of_graphs] Can i compute G*H in sage? -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving

[sage-support] Graph.clique_complex()

clique_complex() does not shows facets *for example*sage: g=Graph({1:[2,5,6,3,4],2:[7,3,5,4],3:[8,4,5],4:[9,5],5:[10]}) sage: g.clique_complex() Simplicial complex with 10 vertices and 6 facets -- You received this message because you are subscribed to the Google Groups "sage-support" group