Contents - Index


PURPOSE Construct the line graph of a graph or network.

DESCRIPTION The line graph of a graph G is the graph obtained by using the edges of G as vertices, two vertices being adjacent whenever the corresponding edges are. In a digraph the arcs of a digraph are the vertices and two vertices are adjacent if the corresponding arcs induce a walk.

Input Dataset: 
Name of file containing graph from which to create the line graph. Data type: Digraph.

Include self-loops: (Default = NO)
NO means that self loops will not generate vertices in the line graph.

Output dataset: (Default = 'Linegraph')
Name of file which contains constructed linegraph.
LOG FILE Adjacency matrix of the line graph vertices labeled with corresponding edges from original graph


COMMENTS Note that multirelational data cannot be converted to line graph format.  Users should do each relation separately.