Regular graph: Difference between revisions

Regular graph has all vertices of the same valency.

A regular graph with vertices of valency k is called k-valent graph.

The only connected 1-valent graph is K₂.

@@ Line 1: / Line 1: @@
-Regular [[graph theory|graph]] has all [[vertex|vertices]] of the same [[graph theory|valency]]. The only [[connected graph|connected]] 1-valent graph is [[complete graph|K<sub>2</sub>]].
+Regular [[graph theory|graph]] has all [[vertex|vertices]] of the same [[Glossary of graph theory|valency]].
+A regular graph with vertices of valency '''k''' is called '''k-valent graph'''.
+The only [[connected graph|connected]] 1-valent graph is [[complete graph|K<sub>2</sub>]].

Langbahn Team – Weltmeisterschaft