Beruflich Dokumente
Kultur Dokumente
Michel Deza
ENS/CNRS, Paris and ISM, Tokyo
Mikhail Shtogrin
Steklov Institute, Moscow
Mathieu Dutour
Hebrew University, Jerusalem
p.1/53
p.2/53
formed by The skeleton of a polytope is the graph its vertices, with two vertices adjacent if they generate a face of . Theorem (Steinitz) (i) A graph is the skeleton of a -polytope if and only if it is planar and -connected. are in the same combinatorial type if and only if (ii) and is isomorphic to .
A planar graph is represented as Schlegel diagram, the program used for this is CaGe by G. Brinkmann, O. Delgado, A. Dress and T. Harmuth.
p.3/53
and
if if
With the number of faces of gonality . A -valent plane graph is called two-faced if the gonality of its faces has only two possible values and .
-valent plane graphs with vertices and faces of gonality and (classes ),
p.4/53
Polyhedra
'
&
'
'
(fullerenes) octahedrite
Generation programs 1. -valent: CPF for two-faced maps on the sphere by T. Harmuth -valent: CGF for two-faced maps on surfaces of genus by T. Harmuth 2. -valent: ENU by T. Heidemeier 3. General: plantri by G. Brinkmann and B. McKay
4
!
'
'
!
!
p.5/53
Point groups
(point group) (combinatorial group) Theorem (Mani, 1971) Given a -connected planar graph , there exist a -polytope , whose group of isometries is isomorphic to and .
, ,
$
), ( , ), ( , ). (Deza
! " ( ( #
! #
#
#
% &#
% '#
% #
! #
! #
q For q For
% 3#
:( :(
% 3#
,
4 3#
), ( ,
) 1 ( (
#
#
#
,
6
, ), (
#
, ,
), ( , ), ( ,
% 3#
, ), ,
0
#
4 5#
%
% 5#
#
% #
4 5#
#
4 3#
4 8#
% &#
p.6/53
-connectedness
Theorem
(i) Any octahedrite is -connected. (ii) Any -valent plane graph without ( -connected.
)-gonal faces is
(iii) Moreover, any -valent plane graph without ( )-gonal : faces is -connected except of the following serie
p.7/53
-connectedness
Theorem
(i) Any octahedrite is -connected. (ii) Any -valent plane graph without ( -connected.
)-gonal faces is
(iii) Moreover, any -valent plane graph without ( )-gonal : faces is -connected except of the following serie
p.7/53
-connectedness
Theorem
(i) Any octahedrite is -connected. (ii) Any -valent plane graph without ( -connected.
)-gonal faces is
(iii) Moreover, any -valent plane graph without ( )-gonal : faces is -connected except of the following serie
p.7/53
Medial Graph
Given a plane graph , the -valent plane graph is dened as the graph having as vertices the edges of with two vertices adjacent if and only if they share a vertex and belong to a common face.
p.8/53
Medial Graph
Given a plane graph , the -valent plane graph is dened as the graph having as vertices the edges of with two vertices adjacent if and only if they share a vertex and belong to a common face.
p.8/53
5
5
p.9/53
5
5
p.9/53
5
5
p.9/53
p.10/53
Central circuits
A 4valent plane graph G
p.11/53
Central circuits
Take an edge of G
p.11/53
Central circuits
Continue it straight ahead ...
p.11/53
Central circuits
... until the end
p.11/53
Central circuits
A selfintersecting central circuit
p.11/53
Central circuits
A partition of edges of G
CC=4 2, 6, 8
p.11/53
Zigzags
A plane graph G
p.12/53
Zigzags
Take two edges
p.12/53
Zigzags
Continue it leftright alternatively ....
p.12/53
Zigzags
... until we come back
p.12/53
Zigzags
A selfintersecting zigzag
p.12/53
Zigzags
A double covering of 18 edges: 10+10+16
zvector
z=10 , 16 2,0
p.12/53
Let and be (possibly, ) zigzags of a plane graph and let an orientation be selected on them. An edge of is called of type I or type II, if and intersection traverse in opposite or same direction, respectively
Z e
Z e
Type I
Type II
p.13/53
Let and be (possibly, ) zigzags of a plane graph and let an orientation be selected on them. An edge of is called of type I or type II, if and intersection traverse in opposite or same direction, respectively
Z e
Z e
Type I
Type II
Type I
Type II
p.13/53
p.14/53
p.14/53
and let an
p.14/53
and type
C v C
Type I
Type II
p.14/53
have
intersections I and
II
intersection II
II
p.14/53
p.15/53
p.15/53
For classes of octahedrites, graph or graph the size of the intersection of two simple ZC-circuits can be any even number.
p.16/53
Bipartite graphs
A plane graph is bipartite if and only if its faces have even gonality. Theorem (Shank-Shtogrin) For any planar bipartite graph there exist an orientation of zigzags, with respect to which each edge has type I.
Remark
p.17/53
Perfect matching on
Let be a graph with one zigzag with self-intersection numbers .
graphs
(i)
F2
F1
or
(iii) two faces, and are free of , is organized around them in concentric circles. M. Deza, M. Dutour and P.W. Fowler, Zigzags, Railroads and Knots in Fullerenes, Journal of Chemical Information and Computer Sciences, in press.
p.18/53
p.19/53
Railroads, as well as central circuits, can be self-intersecting. A graph is called tight if it has no railroad.
1
#
p.20/53
Railroads, as well as zigzags, can be self-intersecting (doubly or triply). A graph is called tight if it has no railroad.
1
% '#
p.21/53
Triple self-intersection
% 3#
It is smallest such
%
6
p.22/53
p.23/53
p.23/53
p.23/53
Removing zigzags
Take a plane graph and a zigzag
p.24/53
Removing zigzags
Go to the medial
p.24/53
Removing zigzags
Remove the central circuit
p.24/53
Removing zigzags
Take one (out of two) inverse medial graph
p.24/53
Extremal problem
Given a class of tight graphs (octahedrites, graphs ), there exist a constant such that any element of the class has at most ZC-circuits. Every tight octahedrite has at most central circuits. Proof method: Local analysis + case by case analysis. Every tight has exactly zigzags. Proof method: uses an algebraic formalism on the graphs .
Every tight has at most zigzags. Conjecture: The correct upper bound is . checked for
Every tight has at most zigzags. Attempted proof: uses a local analysis on zigzags.
6
p.25/53
12 12
'
14
'
'
p.26/53
20
1
22
#
30
32
'
#
'
p.26/53
There is at least tight graphs with simple zigzags. G. Brinkmann and T. Harmuth computation of fullerenes vertices. with simple zigzags up to
p.27/53
% &#
Tight
, ,
$
# $
,
!
% 5#
p.28/53
Tight
p.28/53
p.29/53
The construction
Take a - or -valent plane graph formed of triangles or squares.
. The graph
is
p.30/53
p.31/53
Final steps
Go to the dual and obtain a - or -valent plane graph, and called which is denoted Goldberg-Coxeter construction.
Operation
p.32/53
1,1
2,0
2,1
p.33/53
1,1
2,0
2,1
p.34/53
Properties
One associates (Eisenstein integer) or (Gaussian integer) to the pair in - or -valent case.
instead of
, then one
vertices, then
vertices if vertices if
If
and all
p.35/53
If the ZC-vector of of is
is
p.36/53
If the ZC-vector of of is
is
p.36/53
If the ZC-vector of of is
is
p.36/53
-product formalism
Given a -valent plane graph , the zigzags of the are obtained by: Goldberg-Coxeter construction of
and
of a group ,
-product
For zigzags.
with
, this gives ,
or
M. Dutour and M. Deza, Goldberg-Coxeter construction for - or -valent plane graphs, Electronic Journal of Combinatorics, 11-1 (2004) R20.
p.37/53
Illustration
For any ZC-circuit of , there exist = -valent case = -valent case The [ZC]-vector of is the vector where is the number of ZC-circuits with order
If
has
zigzags if
6
6
6
6 %
6
6
p.38/53
V. Parametrizing graphs
p.39/53
Parametrizing graphs
Idea: the hexagons are of zero curvature, it sufces to give relative positions of faces of non-zero curvature. Goldberg (1937) All , or of symmetry ( , ) or ( , ) are given by Goldberg-Coxeter . construction
)
), ( ,
(
Fowler and al. (1988) All are described in terms of Graver (1999) All parameters.
6
of symmetry parameters.
or
7 #
4 5#
can be encoded by
6
integer complex ,
are parametrized by
p.40/53
triangles in
The graph
#
p.41/53
with
All
if and only if
p.42/53
General theory
Extensions: -valent or -valent graphs.
Dictionnary
-valent graph
-valent graph
'
Eisenstein integers
Gaussian integers
'
& #
&
p.43/53
Number of parameters
Graphs Groups Octahedrites:
Graph Group
Group
Graphs
'
'
Group
'
If there is just one parameter, then this is Goldberg-Coxeter construction (of Octahedron, Tetrahedron, Cube, Dodecahedron for octahedrite, , , , respectively).
'
'
#3
p.44/53
Conjecture on
are described by two complex parameters. They exists if and only if and .
% # % '# % #
4 #
4 '#
% 5 ( ! " #
%
If
amongst
! 6
p.45/53
More conjectures
All with only simple zigzags are: , and the family of with parameters with and
and
% #
or
% #
or
4 #
Any
% #
or
% #
% #
and, otherwise,
iff
, they are
p.46/53
p.47/53
Klein map:
Dyck map:
Zigzags (and central circuits), being local notions, are dened on any surface, even on non-orientable ones. Goldberg-Coxeter and parameter constructions are dened only on oriented surfaces.
p.48/53
Lins trialities
notation in [1] notation in [2] gem dual gem phial gem skew-dual gem skew gem skew-phial gem Jones, Thornton (1987): those are only good dualities.
our notation
1. S. Lins, Graph-Encoded Maps, J. Combinatorial Theory Ser. B 32 (1982) 171181. 2. K. Anderson and D.B. Surowski, Coxeter-Petrie Complexes of Regular Maps, European J. of Combinatorics 23-8 (2002) 861880.
p.49/53
Example: Tetrahedron
p.50/53
7 6 2 5 3 4
Two representation of : on Torus and as a Cube with cyclic orientation of vertices (marked by ) reversed.
Theorem For bipartite graph embedded in oriented surface, the skew operation is, in fact, reversing orientation of one of the part of the bipartition.
p.51/53
Conjecture
has
iff
is even;
has
non-oriented.
has
non-oriented;
has
oriented.
p.52/53
The End
Removing
central circuits of
p.53/53