# minimalDegree -- computes the minimal degree of a graph

## Synopsis

• Usage:
d = minimalDegree G
• Inputs:
• G, an instance of the type Graph,
• Outputs:
• d, an integer, the minimal degree of a graph

## Description

This computes the minimal vertex degree of an undirected graph.

 i1 : G = graph({{1,2}}); i2 : minimalDegree G o2 = 1

## Ways to use minimalDegree :

• "minimalDegree(Graph)"

## For the programmer

The object minimalDegree is .