Using SageMath in Graph Theory скачать в хорошем качестве

Using SageMath in Graph Theory

Introducing SageMath 0:40 What is Sage Math? 1:30 How to use SageMath 3:31 SageMathCell interface 4:03 Cocalc Interface (Jupyter) 6:57 Install SageMath 9.2 9:02 Advantage of local installation Creating and Displaying Graphs 11:36 Opening SageMath 12:56 Using '?' for help/description of a command 14:40 Defining a graph using dictionary 17:01 to list the vertices 18:06 to list the edges 18:53 Displaying the graph using plot()/show() 22:20 Labeling the edges 26:45 Graph with loops and multiple edges 30:15 Adding vertices and edges 36:00 Deleting vertices and edges Database of Families of Graph 39:15 Defining graphs from the database of graphs 40:16 Simple graphs like Petersen graph, Bull graph, polyhedral graph, etc. 45:15 Families of graphs on n vertices like 45:38 CycleGraph(), 46:44 CompleteGraph(), 49:05 CompleteBipartiteGraph(), 50:19 CompleteMultipartiteGraph() and 52:26 CubeGraph(). 57:52 Random graphs 58:06 RandomGNM(), and 59:32 RandomGNP 1:02:55 WorldMap() Generating graph from a matrix 1:06:22 Adjacency matrix 1:10:17 Incidence matrix 1:13:45 Generating graphs on N vertices Display Layouts 1:18:13 Displaying the graph (random layout) 1:19:14 Circular layout 1:20:20 Tree layout 1:23;53 Planar layout 1:26:38 3D Layout 1:27:23 Saving the graph as an image file 1:30:48 Functions to Analyze Graph 1:31:44 Graph Taxonomy 1:45:02 List 1:48:13 Properties of graphs 1:48:22 Connectedness 1:58:34 Bipartite 2:00:31 Eulerian 2:03:33 Hamiltonian