HALOWERKDatenvertragswerk
adjacency cospectral graph family
Given n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order, n+1 entries, leading1, each-120..120. Any well-formed monic polynomial is accepted; an unrealizable polynomial gives a known empty family, not unknown. Each returned graph carries its uppertrianglebitcode, full sorted edges, vertexindexed degree vector and.
POST https://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| n | integer, null | Ja | |
| coefficients | Siehe Schema | Ja | |
| claimed_graph_codes | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"coefficients",
"claimed_graph_codes"
],
"properties": {
"n": {
"type": [
"integer",
"null"
],
"minimum": 1,
"maximum": 5
},
"coefficients": {
"anyOf": [
{
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": -120,
"maximum": 120
},
"minItems": 2
},
{
"type": "null"
}
]
},
"claimed_graph_codes": {
"anyOf": [
{
"type": "array",
"maxItems": 1024,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1023
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"n": 5,
"coefficients": [
1,
0,
-4,
0,
0,
0
],
"claimed_graph_codes": [
15,
54,
90,
108,
113,
149,
163,
281,
323,
396,
402,
480,
553,
581,
650,
676,
720,
774,
816,
840
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden
- Datenvertragswerk0,003 USDC
array subscript section trace
POSThttps://datenvertrag.halowerk.com/v1/array-subscript-section-traceFrom an already decoded rectangular integer-or-null array with explicit lower bounds, resolve PostgreSQL-style element or mixed rectangular slice access and return complete source offsets, coordinates and selected values. A colon switches e