GraphEdgeCount

The edges of the graph.

✓ checked against that system · ! checked, with disagreements (hover a chip)FindStatSt000081via LabeledGraph✓↗

GraphEdgeCount(graph)The edges of the graph.

Typed signatures

Type	Package	Applies
(labeled_graph) -> number	combinatorics	always

Domain: Graph statistics

Details

• Defined over LabeledGraph as an expression in _x, evaluated by compute-engine — the definition IS the implementation.
• Takes a LabeledGraph and nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer.
• FindStat's St000081. The graph with no vertices gives 0.

Definition

Epsil, as the implementation runs it.

on LabeledGraph, over _x

Length(_x[2])

Examples

Basic #

the graph on 4 vertices with the edges 12, 23, 24 and 34

live ↗

In$\mathrm{GraphEdgeCount}(\operatorname{LabeledGraph}((4,\bigl\lbrack\bigl\lbrack1, 2\bigr\rbrack, \bigl\lbrack2, 3\bigr\rbrack, \bigl\lbrack2, 4\bigr\rbrack, \bigl\lbrack3, 4\bigr\rbrack\bigr\rbrack)))$Out$4$

Properties #

FindStat's value for ([],0)

live ↗

In$\mathrm{CombinatorialStat}(\operatorname{LabeledGraph}((0,\bigl\lbrack\bigr\rbrack)), \text{GraphEdgeCount})$Out$0$

Known value · FindStat St000081

FindStat's value for ([],1)

live ↗

In$\mathrm{CombinatorialStat}(\operatorname{LabeledGraph}((1,\bigl\lbrack\bigr\rbrack)), \text{GraphEdgeCount})$Out$0$

Known value · FindStat St000081

FindStat's value for ([],2)

live ↗

In$\mathrm{CombinatorialStat}(\operatorname{LabeledGraph}((2,\bigl\lbrack\bigr\rbrack)), \text{GraphEdgeCount})$Out$0$

Known value · FindStat St000081

About

Examples	4
Crosswalk	FindStat