2015-12-14 20:33:10 +0200 | received badge | ● Editor (source) |
2015-12-14 20:20:10 +0200 | asked a question | How to make a graph from an latin square matrix ? As the question says I want to write a program that will make a graph from the given matrix ? How can I do that in Sage? |
2015-12-14 20:08:13 +0200 | asked a question | How to plot a colored graph from a latin square? The program will get input in form of a matrix that is a latin square. This matrix will be dealt with as a blueprint for a complete graph, each cell of the matrix representing the color. How can I plot such matrices? |
2015-12-07 21:42:00 +0200 | received badge | ● Student (source) |
2015-12-07 18:07:40 +0200 | received badge | ● Scholar (source) |
2015-12-07 17:43:12 +0200 | asked a question | Check SDR in a bipartite graph by Hall's theorem. How can I check existence of a complete SDR in a bipartite graph ? This will be done by checking if there is a perfect matching in the graph(Hall's marriage theorem), but How can I implement this in SAGE? |