3 articles
Degree (graph theory)
Degree (also vertex degree) is a graph theory measure of how many edges meet at a vertex; it underlies the handshaking lemma and degree centrality in networks.
Girth (graph theory)
In graph theory, the girth of a graph is the length of its shortest cycle in edges; graphs with no cycles are assigned girth 0 or infinity by convention.
Regular graph
A regular graph is a simple, undirected graph in which every vertex has the same number of neighbors, its degree k; a k-regular graph exists exactly when nk is even.