No CrossRef data available.
Published online by Cambridge University Press: 01 September 1998
For an undirected graph G=(V, E), let σ(L(G)) be the size of the maximum cut of the line graph L(G). Let dv denote the degree of the vertex v in G. Then we have the following results.
(a) If G=(V, E) is Eulerian, then
formula here
(b) If G is not Eulerian, then
formula here