highly irregular graph
connected graph in which all neighbors of every vertex have distinct degrees
Press Enter · cited answer in seconds
0 sources
highly irregular graph
Summary
Key Facts
- highly irregular graph's subclass of is recorded as connected graph[1].
- highly irregular graph's subclass of is recorded as bridged graph[2].
- highly irregular graph's Freebase ID is recorded as /m/010gp4hp[3].
- highly irregular graph's Wikidata usage instructions is recorded as MathWorld and Wolfram Language require highly irregular graphs to be connected, while the Wikipedia article makes no mention of limiting the class to connected graphs. However, disconnected highly irregular graphs are just disjoint unions of connected highly irregular graphs, so they aren't very interesting.[4].
- highly irregular graph's MathWorld ID is recorded as HighlyIrregularGraph[5].
- highly irregular graph's Wolfram Language entity code is recorded as Entity["GraphClass", "HighlyIrregular"][6].
- highly irregular graph's Microsoft Academic ID is recorded as 2780710854[7].