Description
Assign the remaining stubs to the right and add one to each new degree only when connectingEdge; return the resulting totalDegree.
A graph's degree records how many edge incidences meet a vertex. Directed edges distinguish incoming and outgoing incidences, while loops and parallel edges require explicit counting conventions; a local degree formula does not reconstruct a graph.
Assign the remaining stubs to the right and add one to each new degree only when connectingEdge; return the resulting totalDegree.
When to use this tool
Use Graph Vertex Split Degree Balance when you need a degree or incidence calculation under the stated graph convention.
How to use the tool and how it works
- Enter degree, leftStubs, connectingEdge. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read leftDegree, rightDegree, totalDegree. Use the output convention below.
Require nonnegative integer degree and leftStubs within it. Assign the remaining stubs to the right and add one to each new degree only when connectingEdge; return the resulting totalDegree.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| degree | Degree | Required. Safe integer; minimum 0. |
| leftStubs | Left Stubs | Required. Safe integer; minimum 0. |
| connectingEdge | Connecting Edge | Required. Boolean. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| leftDegree | Left Degree | Required. Safe integer. |
| rightDegree | Right Degree | Required. Safe integer. |
| totalDegree | Total Degree | Required. Safe integer. |
{
"input": {
"degree": 5,
"leftStubs": 2,
"connectingEdge": true
},
"output": {
"leftDegree": 3,
"rightDegree": 4,
"totalDegree": 7
}
}Limitations and assumptions
- This supplied split budget does not perform a graph mutation or check actual endpoints, loops, valid stub reassignment, or structural consequences.
- Inputs must satisfy both the field types and the cross-field conditions above. Invalid input causes an error; a successful false flag or documented placeholder is a different result.
- Numeric calculations use binary floating point unless exact decimal-integer arithmetic is explicitly stated. No hidden measurement tolerance or decimal rounding is added; nonfinite or out-of-contract results are rejected. Numeric signed-zero results are exported as zero.
Alternative or Complementary methods
Build an adjacency structure and count actual incidences when a full graph is available. Validate loop, multiplicity, direction, and vertex-set assumptions before applying a simple-graph identity.
References
Similar or alternative tools
- Graph Cartesian Product Degree Term
Require nonnegative integer firstDegree and secondDegree and return their sum.
- Graph Degree Sequence Single Node Budget
Return nodes-1-degree as remainingNeighbors and feasible when degree is below nodes.