Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2023-05-19 14:34:36 +0200 | received badge | ● Popular Question (source) |
| 2023-04-07 00:58:19 +0200 | received badge | ● Famous Question (source) |
| 2023-04-07 00:58:19 +0200 | received badge | ● Notable Question (source) |
| 2023-04-07 00:58:19 +0200 | received badge | ● Popular Question (source) |
| 2022-10-25 10:43:40 +0200 | received badge | ● Famous Question (source) |
| 2022-10-25 10:43:40 +0200 | received badge | ● Notable Question (source) |
| 2021-06-22 19:13:17 +0200 | received badge | ● Famous Question (source) |
| 2021-06-22 19:08:50 +0200 | received badge | ● Popular Question (source) |
| 2021-03-04 17:13:25 +0200 | received badge | ● Popular Question (source) |
| 2021-01-07 21:30:59 +0200 | received badge | ● Notable Question (source) |
| 2020-06-17 11:39:42 +0200 | received badge | ● Popular Question (source) |
| 2020-01-17 05:11:27 +0200 | received badge | ● Popular Question (source) |
| 2019-06-10 11:34:29 +0200 | received badge | ● Supporter (source) |
| 2019-06-09 13:42:13 +0200 | asked a question | Computing the automorphism group of weighted graphs Is there a way to compute the automorphism group of a weighted graph? The question is already asked at the link below but no one has given any answer for it. https://ask.sagemath.org/question/427... |
| 2019-05-25 20:12:04 +0200 | received badge | ● Notable Question (source) |
| 2019-01-23 16:03:23 +0200 | received badge | ● Popular Question (source) |
| 2019-01-18 01:08:49 +0200 | commented answer | How to compute the number of nodes in each orbit of a graph? Thanks alot. |
| 2019-01-17 03:24:15 +0200 | asked a question | How to compute the number of nodes in each orbit of a graph? I use the below code to calculate the orbits of a graph. Please help me with a piece of code that can compute the number of nods in each orbit of the graph? I desire to have a vector in output where its elements are the number of nodes in each orbit. |
| 2018-08-28 11:02:33 +0200 | commented answer | How can I compute the minimal fixing set? @tmonteil, I guess the MILP solver tries to find the solution via some iterations. Could we stop the code after some iterations (for example after 5 hours) and see the returned minimal solution? |
| 2018-08-25 04:53:09 +0200 | commented answer | How can I compute the minimal fixing set? Below is a link to download the graph structure. http://uupload.ir/filelink/URYW8VJ1c3... It is a 274 node graph with 28311552 automorphisms. This is one of the smallest graphs I am working on. |
| 2018-08-25 04:52:23 +0200 | received badge | ● Commentator |
| 2018-08-24 11:18:57 +0200 | commented answer | How can I compute the minimal fixing set? yes, you are right. Do you have any idea how we could speed up the algorithm to find S for a large set of automorphisms? |
| 2018-08-24 06:04:51 +0200 | commented answer | How can I compute the minimal fixing set? The code works for small graphs but for large graph (200 nodes) it couldn't find the solution after one day. Could you modify the code so it sweep over the generators instead of automorphiosms. For example, having a set of generators like gens=[(14,15), (13,14), (12,13), (9,11), (7,12), (6,7), (5,9), (4,10)(197,224)(198,225)(199,226)(202,229)(204,231)(205,232)(206,233)(218,245)(219,246), (3,5), (2,8)] could you modify the code so that we can feed in the generators to the code and find the set S by sweeping on generators instead of automorphisms? |
| 2018-08-23 04:35:23 +0200 | commented answer | How can I compute the minimal fixing set? Thanks a lot for your time. It works perfectly. |
| 2018-08-21 13:01:42 +0200 | asked a question | How can I compute the minimal fixing set? Having the automorphism group Aut(G) of graph G, what is the minimal set of nodes S where each automorphism in Aut(G) contains at least one of the nodes in a set S? For small graphs it could be computed without using Sage or any other programming. However, for large graphs, writing a piece of code is necessary. |
| 2018-08-08 10:31:56 +0200 | asked a question | How can I compute the orbits of an automorphism group? I am new on automorphisms, need to know how to compute the orbits of an automorphism group in Sage. |
| 2018-07-24 10:55:17 +0200 | commented answer | Finding the frequency of each number in a string Thanks a lot. |
| 2018-07-22 11:59:41 +0200 | asked a question | Finding the frequency of each number in a string Hi, I have a string of numbers like s=[(11,23),(33,47),(98,20),...,(34,65)] produced by a code in Jupyter. The biggest number is 100. How can I order the numbers based on their frequency of repetition in s? For example for a simple case like s1=[(1,4),(2,4),(4,1)] the result is Number 4 frequency 3 Number 1 frequency 2 number 2 frequency 1 |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.