Revision history [back]

Hi @vidyarthi

I try to guess, maybe this graph?

def Sier(g):
    h = Graph()
    for i in range(1, g.order() + 1):
        perm = {u: (i, u) for u in g}
        gg = g.relabel(perm=perm, inplace=False)
        h.add_edges(gg.edges())
    return h
f=Sier(graphs.CompleteGraph(4))
v=f.vertices()
n1=[((a,b),(b,a)) for (a,b) in v]
n2=[((a,a),(a,a)) for (a,b) in v]
x=set(n1)-set(n2)
f.add_edges(x)
z=f
z.plot()

Hi @vidyarthi

I try to guess, maybe this graph?

def Sier(g):
    h = Graph()
    for i in range(1, g.order() + 1):
        perm = {u: (i, u) for u in g}
        gg = g.relabel(perm=perm, inplace=False)
        h.add_edges(gg.edges())
    return h
f=Sier(graphs.CompleteGraph(4))
v=f.vertices()
n1=[((a,b),(b,a)) for (a,b) in v]
n2=[((a,a),(a,a)) for (a,b) in v]
x=set(n1)-set(n2)
f.add_edges(x)
z=f
z.plot()
z.plot(figsize=14,vertex_size=1000)