St. Lawrence University
Mathematics, Computer Science and Statistics Department
HRUMC - 2001
Rose Blanding
 
"Properties of Line Graphs"
       
ABSTRACT: A graph G is a set of vertices and edges. Given a graph, G, we can
 construct a line graph L(G) as follows: the vertices of L(G) correspond to the edges of G, and two vertices in L(G) are adjacent if the corresponding edges in G are adjacent. This talk will discuss properties of line graphs.

Back to HRUMC 2001 Index Page

St. Lawrence University
Homepage - Academics Page


Created 5/11/2001
P.Barkley