Separation index of a graph

The concepts of separation index of a graph and of a surface are introduced. We prove that the separation index of the sphere is 3. Also the separation index of any graph faithfully embedded in a surface of genus g is bounded by a funtion of g. 2002 Wiley Periodicals, Inc. J Graph Theory 41: 53–61, 2002 1. GRAPH ISOMORPHISM This first section on the Graph Isomorphism Problem is meant only as motivation for the concept of separation index, which is defined formally in Section 2. In Section 3 we prove that the separation index of the sphere is 3. The separation index of faithfully embedded graphs is discussed in Section 4, and a few open questions are posed. The literature on the Graph Isomorphism Problem is extensive, but we have mentioned just a few references below. The Graph Isomorphism Problem is to determine, given two graphs, whether they are isomorphic. Graph Isomorphism

[1]  G. Ringel.  Das Geschlecht des vollständigen paaren Graphen , 1965 .

[2]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[3]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[4]  P. Mani.  Automorphismen von polyedrischen Graphen , 1971 .

[5]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[6]  Robert E. Tarjan,et al.  Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[7]  G. Ziegler.  Lectures on Polytopes , 1994 .

[8]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[9]  Carsten Thomassen,et al.  Embeddings of graphs with no short noncontractible cycles , 1990, J. Comb. Theory, Ser. B.

[10]  David M. Mount,et al.  Isomorphism of graphs with bounded eigenvalue multiplicity , 1982, STOC '82.

[11]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[12]  Joan P. Hutchinson.  Automorphism properties of embedded graphs , 1984, J. Graph Theory.

[13]  G. C. Shephard,et al.  Convex Polytopes , 1969, The Mathematical Gazette.

[14]  Seiya Negami,et al.  Uniqueness and faithfulness of embedding of toroidal graphs , 1983, Discret. Math..