No CrossRef data available.
Article contents
On the Maximum Cut of Line Graphs
Published online by Cambridge University Press: 01 September 1998
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
For an undirected graph G=(V, E), let σ(L(G)) be the size of the maximum cut of theline graph L(G). Let dv denote the degree of the vertex v in G. Then we have the followingresults.
(a) If G=(V, E) is Eulerian, then
formula here
(b) If G is not Eulerian, then
formula here
Information
- Type
- Research Article
- Information
- Copyright
- 1998 Cambridge University Press
You have
Access