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

The bisection width of cubic graphs

Published online by Cambridge University Press:  17 April 2009

L.H. Clark  and
R.C. Entringer
L.H. Clark
Affiliation:
Department of Mathematics, The University of New Mexico, Albuquerque, NM. 87131United States of America.
R.C. Entringer
Affiliation:
Department of Mathematics, The University of New Mexico, Albuquerque, NM. 87131United States of America.
Rights & Permissions [Opens in a new window]

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 a graph G, define the bisection width bw(G) of G as min { eG(A,B): {A,B} partitions V(G) with ‖A| − |B‖ ≤ 1 } where eG(A, B) denotes the number of edges in G with one end in A and one end in B. We show almost every cubic graph G of order n has bw(G) ≥ n/11 while every such graph has bw(G) ≤ (n + 138)/3. We also show that almost every r-regular graph G of order n has bw(G) ≥ crn where cr → r/4 as r → ∞. Our last result is asymtotically correct.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 39 , Issue 3 , June 1989 , pp. 389 - 396
Copyright
Copyright © Australian Mathematical Society 1989

References

[1] Alon, N., ‘Eigenvalues and expanders’, Combinatorica 6 (1986), 83–96.CrossRefGoogle Scholar
[2] Alon, N. and Boppana, R. (preprint).Google Scholar
[3] Alon, N. and Milman, V.D., ‘λ1, Isoperimetric inequalities for graphs, and superconcentrators’, J. Combin. Theory Ser. B 38 (1985), 73–88.CrossRefGoogle Scholar
[4] Barnes, E.R., ‘Partitioning the nodes of a graph’, in Graph Theory with Applications to Algorithms and Computer Science, ed. Alavi, Y. et al. , pp. 57–72 (Wiley Interscience, New York, 1985).Google Scholar
[5] Bender, E.A. and Canfield, E.R., ‘The asymptotic number of labelled graphs with given degree sequence’, J. Combin. Theory Ser. A 24 (1978), 296–307.CrossRefGoogle Scholar
[6] Bhatt, S.N. and Leighton, F.T., ‘A framework for solving VLSI graph layout problems’, J. Comput. System Sci. 28 (1984), 300–343.CrossRefGoogle Scholar
[7] Bollobás, B., Graph Theory, An Introductory Course (Springer-Verlag, Berlin, Heidelberg, New York, 1979).Google Scholar
[8] Bollobás, B., ‘A probabilistic proof of an asymptotic formula for the number of labelled regular graphs’, European J. Combin. 1 (1980), 311–316.CrossRefGoogle Scholar
[9] Bui, T.N., Chaudhuri, S., Leighton, F.T. and Sipser, M., ‘Graph bisection algorithms with good average case behaviour’, Combinatorica 7 (1987), 171–191.CrossRefGoogle Scholar
[10] Donath, W.E. and Hoffman, A.J., ‘Lower bounds for the partitioning of graphs’, IBM J. Res. Develop. 17 (1973), 420–425.CrossRefGoogle Scholar
[11] Dunlop, A.E. and Kernighan, B.W., ‘A procedure for placement of standard-cell VLSI circuits’, IEEE Transactions on Computer-Aided Design CAD-4 (1985), 92–98.CrossRefGoogle Scholar
[12] Garey, M.R. and Johnson, D.S., Computers and Intractability: A guide to the thoery of NP-completeness (W.M. Freeman, New York, 1979).Google Scholar
[13] Goldberg, M.K. and Gardner, R., ‘On the minimal cut problem’, in Progress in Graph Theory, ed. Bondy, J.A. et al. , pp. 295–305 (Academic Press, New York, 1984).Google Scholar
[14] Goldberg, M.K., Lath, S. and Roberts, J.W., ‘Heuristics for the graph bisection problem’, (preprint).Google Scholar
[15] Goldberg, M.K. and Lynch, J.F., ‘Lower and upper bounds for the bisection width of a random graph’, Congress. Numer. 49 (1985), 19–25.Google Scholar
[16] Kernighan, B.W. and Lin, S., ‘An efficient heuristic procedure for partitioning graphs’, Bell System Technical J. 49 (1970), 291–307.CrossRefGoogle Scholar
[17] Lubotzky, A., Phillips, R. and Sarnak, P., ‘Ramanujan graphs’, Combinatorica (to appear).Google Scholar
[18] MacGregor, R.M., On partitioning a graph: a theoretical and empirical study. (Ph.D thesis, University of California, Berkeley, 1978).Google Scholar