maximal_degree (434B)
1 # Maximal degree 2 3 The [maximum] of the [degree] of [vertices] in a given [graph] 4 5 Special cases: 6 - A [degree_0_graph] is an [empty_graph] 7 - A [degree_1_graph] is a [disjoint_union] of [isolated_edges] 8 - A [degree_2_graph] is a [disjoint_union] of [path_graphs] and [cycle_graphs] 9 - A [degree_3_graph] is a [graph] where the maximum degree is 3 10 - see also [cubic_graph], where the degree of each vertex is 3 11 12 Up: [degree], [maximum]