Finite Graph

A graph with a finite number of nodes and edges. If it has nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph .

A graph which is not finite is called infinite. If every node has finite degree, the graph is called locally finite. The Cayley graph of a group with respect to a finite generating set is always locally finite, even if the group itself is infinite.

Wolfram Web Resources

Mathematica » The #1 tool for creating Demonstrations and anything technical.	Wolfram\|Alpha » Explore anything with the first computational knowledge engine.	Wolfram Demonstrations Project » Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.
Computerbasedmath.org » Join the initiative for modernizing math education.	Online Integral Calculator » Solve integrals with Wolfram\|Alpha.	Step-by-step Solutions » Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.
Wolfram Problem Generator » Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.	Wolfram Education Portal » Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.	Wolfram Language » Knowledge-based programming for everyone.