If two edges in G share a common vertex, an edge is established between their corresponding vertices in L(G), preserving the adjacency relationships from the original graph.
Undirected line graph
Published inLine graph
If two edges in G share a common vertex, an edge is established between their corresponding vertices in L(G), preserving the adjacency relationships from the original graph.