Synonymous with and . There are some unrelated things also called valence; there are of course many things all called degree.
For directed graphs, in- and out- are prefixed to any of the synonyms, to count incoming and outgoing edges separately.
If is used for the valency of vertex v, the notation (or on its own if there is no scope for confusion) denotes the maximum valency found in graph . Another notation often seen is and for lowest and highest valency in respectively.
If the valency is the same number (, say) for all its vertices, is called regular. More specifically it is called -valent or -regular. Connected (components of)…
…0-valent graphs are edgeless vertices,
…1-valent graphs are pairs of vertices joined by an edge,
…2-valent graphs are cyclic graphs, i.e. -gons, of various sizes
From these structures start getting more interesting. 3-valent (or trivalent) graphs are also known as cubic graphs.
A -valent graph with vertices has edges.
|Date of creation||2013-03-22 15:10:17|
|Last modified on||2013-03-22 15:10:17|
|Last modified by||marijke (8873)|