The critical group of a line graph

Details The critical group of a line graph The critical group of a line graph

2009-04-08

arxiv.org/abs/0904.1246v2

Mathematics

Combinatorics

36 pages

Scientific paper

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected graphs containing no cut-edge. Here the number of independent cycles in the graph, which is known to bound the number of generators for the critical group of the graph, is shown also to bound the number of generators for the critical group of its line graph. The second gives, for each prime p, a constraint on the p-primary structure of the critical group, based on the largest power of p dividing all sums of degrees of two adjacent vertices. The third deals with connected graphs whose line graph is regular. Here known results relating the number of spanning trees of the graph and of its line graph are sharpened to exact sequences which relate their critical groups. The first two results interact extremely well with the third. For example, they imply that in a regular nonbipartite graph, the critical group of the graph and that of its line graph determine each other uniquely in a simple fashion.

Affiliated with

Also associated with

No associations

Rating

The critical group of a line graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The critical group of a line graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The critical group of a line graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-213843