Questions - ASKSAGE: Sage Q&A Forum

46

views

1

answer

no

votes

2025-06-16 07:56:16 +0200 David Coudert

Check if a graph admits a separating 3-cycle.

graph-theory

119

views

no

answers

no

votes

2025-05-22 21:48:26 +0200 Hola

Generating simplicial trees (equivalently, totally balanced hypergraphs) on $n$ vertices

129

views

no

answers

no

votes

2024-10-11 14:37:16 +0200 licheng

Find a perfect bisimplicial ordering in a faster algorithm

314

views

1

answer

3

votes

2024-10-02 13:56:31 +0200 Emmanuel Charpentier

The acyclic orientations function behaves unexpectedly

294

views

1

answer

no

votes

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

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

graph-theory

282

views

1

answer

1

vote

2024-07-22 15:58:02 +0200 vdelecroix

Does Sage have a function to determine vertex cuts?

graph-theory

382

views

1

answer

2

votes

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

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

graph-theory

327

views

3

answers

2

votes

2024-07-15 20:45:00 +0200 vdelecroix

Twin reduction in Graph

graph-theory

195

views

no

answers

no

votes

2024-07-14 13:47:50 +0200 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

263

views

1

answer

no

votes

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

Functions source code

300

views

1

answer

no

votes

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

How to see the source code of the function distance_graph

2k

views

1

answer

no

votes

2024-03-06 04:16:51 +0200 licheng

How to determine whether a graph has l cycles of length k exactly?

189

views

1

answer

1

vote

2023-08-24 14:31:26 +0200 eric_g

How can I check for the new functions in sage 10.1?

328

views

1

answer

2

votes

2023-08-18 08:55:30 +0200 rburing

Problems with memory usage with bliss algorithm

189

views

no

answers

1

vote

2023-07-06 05:06:02 +0200 licheng

Some "strange behaviors“ of longest_path

279

views

2

answers

2

votes

2023-07-05 21:09:26 +0200 Emmanuel Charpentier

Mysterious Disappearance of an edge

314

views

no

answers

no

votes

2023-06-28 11:28:21 +0200 licheng

List all connected subgraphs with exactly k vertices

graph-theory

354

views

1

answer

no

votes

2023-06-24 10:34:36 +0200 licheng

subgraph_search_iterator gives duplicate subgraphs

graph-theory

851

views

1

answer

1

vote

2023-06-19 04:23:49 +0200 licheng

Rooted Product Graphs on Sagemath

975

views

1

answer

1

vote

2023-05-26 11:09:32 +0200 rburing

Can the bytes returned by pynauty's "certificate" function be converted into a graph format readable by Sage?

614

views

1

answer

1

vote

2023-01-10 20:57:01 +0200 slelievre

How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum?

173

views

no

answers

1

vote

2022-10-04 13:09:52 +0200 the1diot

Subdivisions of a graph

512

views

2

answers

no

votes

2022-03-09 08:24:25 +0200 licheng

How to put the drawing of graphs in a matrix or list

754

views

2

answers

1

vote

2022-02-10 23:56:03 +0200 Max Alekseyev

Spanning elementary subgraphs on a given number of vertices

graph-theory

279

views

1

answer

1

vote

2021-11-30 18:16:32 +0200 slelievre

how to find distance matrix in order?

443

views

1

answer

no

votes

2021-11-29 09:36:35 +0200 FrédéricC

how to find subdivision graph of any graph ?

graph-theory

966

views

2

answers

1

vote

2021-09-15 14:56:16 +0200 Max Alekseyev

Working with unlabelled graphs

133

views

no

answers

no

votes

2021-07-25 19:25:20 +0200 morganhouse

Any Built in code for Crossed Prism Graphs on sagemath?

graph-theory

342

views

1

answer

1

vote

2021-06-30 22:54:14 +0200 tmonteil

Is it possible for the spectrum() method to use all CPU cores?

264

views

1

answer

1

vote

2021-05-08 11:22:36 +0200 slelievre

87 questions

Check if a graph admits a separating 3-cycle.

Generating simplicial trees (equivalently, totally balanced hypergraphs) on $n$ vertices

Find a perfect bisimplicial ordering in a faster algorithm

The acyclic orientations function behaves unexpectedly

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

Does Sage have a function to determine vertex cuts?

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

Twin reduction in Graph

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$

Functions source code

How to see the source code of the function distance_graph

How to determine whether a graph has l cycles of length k exactly?

How can I check for the new functions in sage 10.1?

Problems with memory usage with bliss algorithm

Some "strange behaviors“ of longest_path

Mysterious Disappearance of an edge

List all connected subgraphs with exactly k vertices

subgraph_search_iterator gives duplicate subgraphs

Rooted Product Graphs on Sagemath

Can the bytes returned by pynauty's "certificate" function be converted into a graph format readable by Sage?

How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum?

Subdivisions of a graph

How to put the drawing of graphs in a matrix or list

Spanning elementary subgraphs on a given number of vertices

how to find distance matrix in order?

how to find subdivision graph of any graph ?

Working with unlabelled graphs

Any Built in code for Crossed Prism Graphs on sagemath?

Is it possible for the spectrum() method to use all CPU cores?

CubeConnectedCycle not there? Attribute Error

Contributors

Tags