2023-02-07 16:45:01 +0200 | received badge | ● Popular Question (source) |
2020-12-17 23:59:18 +0200 | received badge | ● Nice Question (source) |
2020-09-09 11:41:13 +0200 | received badge | ● Scholar (source) |
2020-09-08 10:20:55 +0200 | received badge | ● Student (source) |
2020-09-07 21:38:05 +0200 | asked a question | Is it possible to know the corresponding graph labeling after using "relabel()"? I am trying to generate the following cayley graph Here, I used the "relabel()" function and I got the following vertices Is it possible to know the corresponding labels? Like for example what is the corresponding permutation for 0? |
2020-09-07 20:46:40 +0200 | commented question | Determine whether a graph is connected after deleting all possible sets of specific size. Thank you for your response. My problem is how to write the code? I was thinking of the following Pseudocode: G= graph V= set of vertices for i in V, for j in V-{i} A= G.neighbors(i) B=G.neighbors(j) H= G.delete_vertices(A U B) if H.is_connected()=False print({i,j}) I don't know how to try this using mathsage. |
2020-09-07 01:47:27 +0200 | asked a question | Determine whether a graph is connected after deleting all possible sets of specific size. I have a graph of 60 vertices. I want to delete the vertices {u, v, N(u), N(v)} and check whether the resulting graph is connected, where u and v are vertices and N(u) and N(v) are their corresponding neighbors. How can I write a code that covers all the possibilities? |