In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees. == History == Irregular graphs were initially characterized by Yousef Alavi, Gary Chartrand, Fan Chung, Paul Erdős, Ronald Graham, and Ortrud Oellermann.
In graph theory, a highly irregular graph is a graph in which, for every vertex, all neighbors of that vertex have distinct degrees. == History == Irregular graphs were initially characterized by Yousef Alavi, Gary Chartrand, Fan Chung, Paul Erdős, Ronald Graham, and Ortrud Oellermann.
Source: Wikipedia "Highly irregular graph" · CC BY-SA 4.0
Share this article: X · Bluesky