On the Maximum Cut of Line Graphs

  • Authors:

  • Shuji Shiraishi

  • Affiliations:

  • Department of Applied Mathematics, Fukuoka University, Nanakuma, Jonan-ku, Fukuoka 814-01, Japan (e-mail: shuji@vin.sm.fukuoka-u.ac.jp)

  • Venue:
  • Combinatorics, Probability and Computing
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

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***** Insert equation here *****(b) If G is not Eulerian, then***** Insert equation here *****