maximum vertex degree
maximum number of edges that a vertex is incident to
Press Enter · cited answer in seconds
0 sources
maximum vertex degree
Summary
maximum vertex degree is a graph property[1].
Key Facts
- maximum vertex degree's instance of is recorded as graph property[2].
- maximum vertex degree's subclass of is recorded as non-negative integer[3].
- maximum vertex degree's subclass of is recorded as maximum[4].
- maximum vertex degree's subclass of is recorded as degree[5].
- maximum vertex degree's different from is recorded as degree[6].
- maximum vertex degree's uses is recorded as degree[7].
- maximum vertex degree's Google Knowledge Graph ID is recorded as /g/121jt6z_[8].
- maximum vertex degree's MathWorld ID is recorded as MaximumVertexDegree[9].
- maximum vertex degree's exact match is recorded as http://konect.cc/statistics/maxdegree/[10].
- maximum vertex degree's greater than is recorded as degeneracy[11].
- maximum vertex degree's less than is recorded as edge chromatic number[12].
- maximum vertex degree's less than is recorded as harmonious chromatic number[13].
- maximum vertex degree's less than is recorded as total chromatic number[14].
- maximum vertex degree's less than is recorded as incidence chromatic number[15].
- maximum vertex degree's less than is recorded as carving width[16].
- maximum vertex degree's maintained by WikiProject is recorded as WikiProject Mathematics[17].
- maximum vertex degree's graphclasses.org ID is recorded as par_28[18].