I was reading about The Graph Isomorphism Problem on Wikipedia and the article lists a number of special cases for which the problem can be solved in polynomial time. One of these cases is a graph of bounded degree, i.e.,
the number of incident edges to any node in the graph is bounded by an integer (for the entire graph).
I can't think of a graph that wouldn't be of bounded degree. Can someone give an example or perhaps clarify what the article or definition is saying that I do not understand.
Here is the original Wikipedia article which talks of graphs of bounded degree (although it will probably be unhelpful in answering my question): https://en.wikipedia.org/wiki/Graph_isomorphism_problem#Solved_special_cases.
Here is the Wikipedia article on the degree of a graph: https://en.wikipedia.org/wiki/Degree_(graph_theory).
My best guess at a graph of unbounded degree is something like a Caley digraph for the multiplicative group of positive integers (so any node/integer is connected to an infinite number of nodes/integers), but I am not sure if I understand the definitions correctly.