Regular Graph
Versandkostenfrei!
Versandfertig in 6-10 Tagen
23,99 €
inkl. MwSt.
PAYBACK Punkte
12 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In graph theory, a regular graph is a graph where each vertex has the same number of neighbors, i.e. every vertex has the same degree or valency. A regular graph with vertices of degree k is called a k regular graph or regular graph of degree k. Regular graphs of degree at most 2 are easy to classify: A 0-regular graph consists of disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of disconnected cycles. A 3-regular...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In graph theory, a regular graph is a graph where each vertex has the same number of neighbors, i.e. every vertex has the same degree or valency. A regular graph with vertices of degree k is called a k regular graph or regular graph of degree k. Regular graphs of degree at most 2 are easy to classify: A 0-regular graph consists of disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of disconnected cycles. A 3-regular graph is known as a cubic graph. A strongly regular graph is a regular graph where every adjacent pair of vertices has the same number l of neighbors in common, and every non-adjacent pair of vertices has the same number n of neighbors in common. The smallest graphs that are regular but not strongly regular are the cycle graph and the circulant graph on 6 vertices.
Andere Kunden interessierten sich für
