Hostname: page-component-78c5997874-mlc7c Total loading time: 0 Render date: 2024-11-16T15:22:16.325Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Maximum Cut of Line Graphs

Published online by Cambridge University Press:  01 September 1998

SHUJI SHIRAISHI
SHUJI SHIRAISHI
Affiliation:
Department of Applied Mathematics, Fukuoka University, Nanakuma, Jonan-ku, Fukuoka 814-01, Japan (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

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

formula here

(b) If G is not Eulerian, then

formula here

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 3 , September 1998 , pp. 335 - 337
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)