Grinberg-Introduction-Graph-Theory · Problem 3.15

Multigraphs

Mathematics — Graph Theory · line-graph-multigraph

Problem

Let G=(V,E,φ)G = (V, E, \varphi) be a multigraph. The line graph L(G)L(G) is defined as the simple graph (E,F)(E, F), where F={{e1,e2}∈P2(E)∣φ(e1)∩φ(e2)≠∅}.F = \{\{e_1, e_2\} \in \mathcal{P}_2(E) \mid \varphi(e_1) \cap \varphi(e_2) \neq \varnothing\}. (In other words, L(G)L(G) is the graph whose vertices are the edges of GG, and in which two vertices e1e_1 and e2e_2 are adjacent if and only if the edges e1e_1 and e2e_2 of GG share a common endpoint.)

Browse the problem library