Skip to content

Commit d9fa23d

Browse files
committed
fix issue 38723 in vertex_connectivity
1 parent d1f99d1 commit d9fa23d

File tree

1 file changed

+13
-3
lines changed

1 file changed

+13
-3
lines changed

src/sage/graphs/connectivity.pyx

Lines changed: 13 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1608,6 +1608,16 @@ def vertex_connectivity(G, value_only=True, sets=False, k=None, solver=None, ver
16081608
sage: G.add_edge(0, 1)
16091609
sage: G.vertex_connectivity(value_only=False, verbose=1) # needs sage.numerical.mip
16101610
(3, [])
1611+
1612+
Check that :issue:`38723` is fixed::
1613+
1614+
sage: G = graphs.SierpinskiGasketGraph(3)
1615+
sage: G.vertex_connectivity(k=1) # needs sage.numerical.mip
1616+
True
1617+
sage: G.vertex_connectivity(k=2) # needs sage.numerical.mip
1618+
True
1619+
sage: G.vertex_connectivity(k=3) # needs sage.numerical.mip
1620+
False
16111621
"""
16121622
from sage.graphs.generic_graph import GenericGraph
16131623
if not isinstance(G, GenericGraph):
@@ -1622,8 +1632,8 @@ def vertex_connectivity(G, value_only=True, sets=False, k=None, solver=None, ver
16221632
# We follow the convention of is_connected, is_biconnected and
16231633
# is_strongly_connected
16241634
return k == 1
1625-
if (g.is_directed() and k > min(min(g.in_degree()), min(g.out_degree()))) \
1626-
or (not g.is_directed() and (k > min(g.degree()))):
1635+
if ((g.is_directed() and k > min(min(g.in_degree()), min(g.out_degree())))
1636+
or (not g.is_directed() and (k > min(g.degree())))):
16271637
return False
16281638
value_only = True
16291639
sets = False
@@ -1655,7 +1665,7 @@ def vertex_connectivity(G, value_only=True, sets=False, k=None, solver=None, ver
16551665
return 1 if k is None else (k == 1)
16561666

16571667
if not G.is_triconnected():
1658-
return 2 if k is None else (k == 2)
1668+
return 2 if k is None else (k <= 2)
16591669
elif k == 3:
16601670
return True
16611671

0 commit comments

Comments
 (0)