Applications of graph theory to algebra? Seeing as graphs model relations and algebra is essentially entirely based on relations, one would think that the two fields would inform each other. I know that algebra has many applications to graph theory, but what about applications of graph theory in algebra? Lattice theory, category theory, whatever.
 A: The Amitsur Levitzki theorem can be proven using Euler trails. There's a statement of the theorem and a proof in my blog.
A: Based on nothing more than a vague knowledge of these subjects' existence and the power of Wikipedia, I came up with two. Since these aren't topics I've studied much, I can't say for sure how much actual graph theory is involved. But I can vouch for the fact that graphs seem to be commonly used tools, at the very least for advertising the field to grad students.
Geometric Group Theory

Another important idea in geometric group theory is to consider finitely generated groups themselves as geometric objects. This is usually done by studying the Cayley graphs [...] endowed with the structure of a metric space, given by the so-called word metric.

Bass-Serre Theory

The theory relates group actions on trees with decomposing groups as iterated applications of [algebra things], via the notion of the fundamental group of a graph of groups.

A: Let $G$ be a group and $H$ be a finite index subgroup of $G$. Say $|G:H|=n$. There there exists elements $g_1, \ldots, g_n\in G$ such that the set $\{g_1, \ldots, g_n\}$ forms a set of representatives of all the left cosets of $H$ in $G$ as well as the set of all the right cosets of $H$ in $G$ simultaneously.
This fact has an algebraic proof but it can be neatly proved using the Hall's Matching Theorem (a.k.a the marriage theorem).
A: Some methods for solving huge sparse system of linear equations use some graph theory. 
Try searching the Internet for "system of linear equations" and "strong connected component". The idea is to break the task into smaller (if possible) before applying traditional algebraic methods.
This article seems to be the best introduction.
A: In the theory of permutation groups, there is a result that says that a finite primitive group that contains a transposition is the symmetric group.  The proof uses Higman's theorem that if the permutation group is primitive, then a particular orbital digraph is connected.
