999 questions

Find a perfect bisimplicial ordering in a faster algorithm

• graph
• graph-theory

227

views

1

answer

1

vote

2024-10-25 21:29:46 +0100 FrédéricC

A limit trivial in polar coordinates cannot be computed in Cartesian coordinates. Why ?

• limit

Graphs - Gomory Hu tree - Memory blow up and max recursion depth [closed]

• graphs
• gomory-hu
• RecursionError
• Memory

The acyclic orientations function behaves unexpectedly

• graph-theory
• orientations
• confirmed_issue

How to make edges Curve with Plot

191

views

1

answer

3

votes

2024-09-27 02:31:25 +0100 John Palmieri

Graphs - vertex_connectivity - misleading behavior for parameter k [closed]

• graph_theory
• combinatorics
• connectivity
• vertex_connectivity
• confirmed_issue

221

views

1

answer

1

vote

2024-09-25 22:54:25 +0100 Max Alekseyev

Error while computing gomory hu tree of graph using LP [closed]

• graphtheory
• gomory-hu
• graphs
• combinatorics
• LP

`legend_label` for 2d scatter plot

• 2Dplot

216

views

no

answers

no

votes

2024-08-30 13:09:19 +0100 rburing

how to get the sagemath programs related to graphs with nodes and edges

i have to draw a regular graph vertex with 120 elements each with degree 9 ie. 9_regular graph with 120 vertex. pls suggest some programs [closed]

Memory leak in is_planar

• memory-leak
• is_planar
• graphs

Is there a way to get the Tait graph from a knot diagram?

• knots
• ask-sage
• snappy
• knot-theory
• laplacian

Is there a way to get the Tait graph from a knot diagram? [closed]

• knots
• ask-sage
• snappy
• knot-theory
• laplacian

224

views

1

answer

no

votes

2024-07-23 21:16:51 +0100 John Palmieri

Does Sage have a built-in function to output an adjacency list?

• graph-theory

Does Sage have a function to determine vertex cuts?

• graph-theory

247

views

1

answer

2

votes

2024-07-21 15:27:52 +0100 rburing

The canonical labels in SageMath are different from those in nauty.

• graph-theory

168

views

no

answers

no

votes

2024-07-14 13:47:50 +0100 rewi

Does there exists any simple connected graph $G$ of order $n$, such that whenever $\dfrac{\lambda}{k}$ is an eigenvalue of the adjacency matrix of $G$

• graph-theory

Twin reduction in Graph

• graph-theory

vertex labels exceed space and intersect with edges

• 2Dplot
• Elliptic-curves

Not interactive plot

• 2Dplot

name 'Graph' is not defined

• graphtheory

493

views

1

answer

no

votes

2024-05-23 21:38:58 +0100 Max Alekseyev

Connected non-bipartite graphs with a unique perfect matching having highest value of determinant

Incorrect plot

• 2Dplot

174

views

1

answer

no

votes

2024-05-02 19:53:18 +0100 John Palmieri

Functions source code

• graph-theory
• source-code
• is_isomorphic
• is_subgraph

Generate all connected graphs of order 12 with matching number of 4

• graphtheory

164

views

1

answer

no

votes

2024-04-01 12:57:56 +0100 rburing

Reference for cospectral_graphs function?

• cospectral

How to determine there is a k-path between two vertices

• graphtheory

How to specify dashed edges in SageMath?

• graphtheory

How to store images of graphs in a PDF?

• graphtheory
• pdf

257

views

1

answer

no

votes

2024-03-17 10:22:32 +0100 rburing

How to see the source code of the function distance_graph

• graph-theory
• source