Editing Glossary of graph theory (section)

==V==
{{glossary}}

{{term|V|''V''}}
{{defn|See ''vertex set''.}}

{{term|valency}}
{{defn|Synonym for ''{{gli|degree}}''.}}

{{term|vertex}}
{{defn|A [[Vertex (graph theory)|vertex]] (plural vertices) is (together with edges) one of the two basic units out of which graphs are constructed. Vertices of graphs are often considered to be atomic objects, with no internal structure.}}

{{term|vertex cut}}
{{term|separating set|multi=y}}
{{defn|A set of {{gli|vertex|vertices}} whose removal {{gli|disconnected|disconnects}} the {{gli|graph}}. A one-vertex cut is called an {{gli|articulation point}} or {{gli|cut vertex}}.}}

{{term|vertex set}}
{{defn|The set of vertices of a given graph {{mvar|G}}, sometimes denoted by {{math|''V''(''G'')}}.}}

{{term|vertices}}
{{defn|See ''vertex''.}}

{{term|Vizing}}
{{defn|no=1|[[Vadim G. Vizing]]}}
{{defn|no=2|[[Vizing's theorem]] that the chromatic index is at most one more than the maximum degree.}}
{{defn|no=3|[[Vizing's conjecture]] on the domination number of Cartesian products of graphs.}}

{{term|volume}}
{{defn|The sum of the degrees of a set of vertices.}}

{{glossary end}}