Cyclic Edge Connectivity
cyclic_edge_connectivityDetermine the smallest k in [kmin, kmax] for which a graph has a cyclic k-edge-cut, returning null if none exists to suggest raising kmax.
Instructions
Smallest k in [kmin, kmax] for which the graph has a cyclic k-edge-cut.
That value is the graph's cyclic edge connectivity when it falls inside the search range; a null answer means none was found and kmax should be raised.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"graph": "<graph>"
},
"name": "cyclic_edge_connectivity"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| kmax | No | largest cut size to try. | |
| kmin | No | smallest cut size to try; must be greater than 3. | |
| graph | Yes | a graph6 string or a registry name. | |
| max_order | No | vertex-count ceiling for the exhaustive search. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||