First time here? Check out the FAQ!
Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
RSS
Sort by »
relevance
date
activity
answers ▼
votes
999
questions
Tagged
394
views
1
answer
4
votes
2019-09-15 14:14:02 +0100
fmorlin
Memory leak with matroid is_connected method
graphs
GF
confirmed_issue
memory-leak
matroid
298
views
1
answer
1
vote
2019-06-06 10:43:54 +0100
slelievre
chromatic polynomial graph with loops
confirmed_issue
280
views
1
answer
no
votes
2018-03-18 11:21:32 +0100
David Coudert
Graph structure having maximum algebraic connectivity among some given blocks
354
views
1
answer
1
vote
2018-07-16 16:32:47 +0100
tmonteil
Finding the generators for automorphisms of a graph
automorphisms
generators
469
views
1
answer
1
vote
2020-09-09 18:12:48 +0100
slelievre
graph_editor doesn't work in jupyter notebook of sagemath
445
views
1
answer
1
vote
2013-03-14 12:08:21 +0100
fidbc
Algorithm implementation in Sage
graph_theory
Code
Implementation
553
views
1
answer
1
vote
2019-01-21 10:15:08 +0100
slelievre
How to compute the number of nodes in each orbit of a graph?
533
views
1
answer
no
votes
2017-07-28 20:48:28 +0100
dan_fulea
networkx can't compute algebraic connectivity
networkx
graph-theory
linear-algebra
412
views
1
answer
1
vote
2021-02-28 03:06:31 +0100
Max Alekseyev
$k$-independence number in graphs
independece
347
views
1
answer
1
vote
2018-03-07 16:35:32 +0100
tmonteil
Flow gives error for disconnected vertices
paths
disconnected
confirmed_issue
graph
flow
1k
views
1
answer
1
vote
2015-04-27 10:45:36 +0100
bssteniss
How can I search and count all induced subgraphs in a directed graph with edge labels?
Induced
subgraph
edge_labels
subgraph_search
482
views
1
answer
1
vote
2017-07-21 17:29:36 +0100
tmonteil
Way to solve max_split enumeration
graph-algorithm
cliques
split
1k
views
1
answer
no
votes
2015-10-06 18:00:49 +0100
fidbc
hasse diagram of a subset of a poset
Poset
directed-graphs
graph-theory
1k
views
1
answer
2
votes
2017-06-18 18:41:03 +0100
happys5
Plot Multiple 3D Graphs that overlap
3D-plots
3k
views
1
answer
1
vote
2014-02-13 00:52:48 +0100
fidbc
Using nauty_geng with variable number of vertices
nauty
graph
isomorphism
33k
views
1
answer
no
votes
2023-04-28 13:57:02 +0100
rewi
Bicyclic Graphs with fixed girth having highest second smallest laplacian eigen value from a collection [closed]
406
views
1
answer
2
votes
2018-07-23 09:40:44 +0100
kristi
Preserving the rooted tree layout in graphs
731
views
1
answer
1
vote
2021-07-20 01:33:16 +0100
John Palmieri
Plotting a Cayley graph
543
views
1
answer
no
votes
2013-02-08 04:14:45 +0100
ppurka
graph formatting issue in graphics array
graphics_array
821
views
1
answer
3
votes
2011-07-15 06:35:48 +0100
parzan
Best way to plot graph
plot
digraph
tree
neural
Network
485
views
1
answer
1
vote
2019-05-05 11:27:55 +0100
slelievre
Constructing graphs using permutation or symmetric groups
graph-theory
permutation
238
views
1
answer
no
votes
2023-06-24 10:34:36 +0100
licheng
subgraph_search_iterator gives duplicate subgraphs
graph-theory
792
views
1
answer
1
vote
2018-09-25 14:38:33 +0100
kristi
Why does this error arise?
graph-theory
140
views
1
answer
1
vote
2023-08-24 14:31:26 +0100
eric_g
How can I check for the new functions in sage 10.1?
graph-theory
documentation
353
views
1
answer
1
vote
2016-05-12 18:18:36 +0100
tmonteil
Using a lambda expression in digraphs fails for len(G.sinks())?
digraph
directed-graphs
lambda
sinks
graph_generation
295
views
1
answer
no
votes
2022-07-06 13:43:44 +0100
Max Alekseyev
How to find the graphs having exactly one perfect matching from the following collection?
992
views
1
answer
1
vote
2016-05-31 20:52:47 +0100
William Stein
show() does not show in the right place
show
graph
bug
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
566
views
1
answer
no
votes
2013-02-23 23:46:13 +0100
fidbc
Simple tree diagram
tree
graph
183
views
1
answer
no
votes
2023-04-08 11:31:29 +0100
David Coudert
Is there any code to list all minimal k-distance dominating sets of a simple graph G in sagemath?
dominating_set
k-distance
dominating
sets
« previous
1
...
17
18
19
20
21
...
34
next page »
Contributors
Tags
graph-theory
×6
graph
×4
confirmed_issue
×3
digraph
×2
directed-graphs
×2
tree
×2
3D-plots
×1
automorphisms
×1
bug
×1
cliques
×1
Code
×1
disconnected
×1
documentation
×1
dominating
×1
dominating_set
×1
edge_labels
×1
flow
×1
generators
×1
GF
×1
graph-algorithm
×1
graph_generation
×1
graphics_array
×1
graphs
×1
graph_theory
×1
Implementation
×1
independece
×1
Induced
×1
isomorphism
×1
k-distance
×1
lambda
×1
linear-algebra
×1
matroid
×1
memory-leak
×1
nauty
×1
Network
×1
networkx
×1
neural
×1
paths
×1
permutation
×1
plot
×1
Poset
×1
sets
×1
show
×1
sinks
×1
split
×1
subgraph
×1
subgraph_search
×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.
Powered by Askbot version 0.7.59
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how
dummy
×