Results 1  10
of
19
Light Paths in 4Connected Graphs in the Plane and Other Surfaces
 J. Graph Theory
, 1998
"... Several results concerning existence of kpaths, for which the sum ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Several results concerning existence of kpaths, for which the sum
Encoding fullerenes and geodesic domes
 SIAM. J. Discrete Math
, 2004
"... Abstract. Coxeter’s classification of the highly symmetric geodesic domes (and, by duality, the highly symmetric fullerenes) is extended to a classification scheme for all geodesic domes and fullerenes. Each geodesic dome is characterized by its signature: a plane graph on twelve vertices with label ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. Coxeter’s classification of the highly symmetric geodesic domes (and, by duality, the highly symmetric fullerenes) is extended to a classification scheme for all geodesic domes and fullerenes. Each geodesic dome is characterized by its signature: a plane graph on twelve vertices with labeled angles and edges. In the case of the Coxeter geodesic domes, the plane graph is the icosahedron, all angles are labeled one, and all edges are labeled by the same pair of integers (p, q). Edges with these “Coxeter coordinates ” correspond to straight line segments joining two vertices of Λ, the regular triangular tessellation of the plane, and the faces of the icosahedron are filled in with equilateral triangles from Λ whose sides have coordinates (p, q). We describe the construction of the signature for any geodesic dome. In turn, we describe how each geodesic dome may be reconstructed from its signature: the angle and edge labels around each face of the signature identify that face with a polygonal region of Λ and, when the faces are filled by the corresponding regions, the geodesic dome is reconstituted. The signature of a fullerene is the signature of its dual. For each fullerene, the separation of its pentagons, the numbers of its vertices, faces, and edges, and its symmetry structure are easily computed directly from its signature. Also, it is easy to identify nanotubes by their signatures.
Fullerenes as tilings of surfaces
 J. Chem. Inf. Comput. Sci
"... If a fullerene is defined as a finite trivalent graph made up solely of pentagons and hexagons, embedding in only four surfaces is possible: the sphere, torus, Klein bottle, and projective (elliptic) plane. The usual spherical fullerenes have 12 pentagons; elliptic fullerenes, 6; and toroidal and Kl ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
If a fullerene is defined as a finite trivalent graph made up solely of pentagons and hexagons, embedding in only four surfaces is possible: the sphere, torus, Klein bottle, and projective (elliptic) plane. The usual spherical fullerenes have 12 pentagons; elliptic fullerenes, 6; and toroidal and Kleinbottle fullerenes, none. Kleinbottle and elliptic fullerenes are the antipodal quotients of centrosymmetric toroidal and spherical fullerenes, respectively. Extensions to infinite systems (plane fullerenes, cylindrical fullerenes, and space fullerenes) are indicated. Eigenvalue spectra of all four classes of finite fullerenes, are reviewed. Leapfrog fullerenes have equal numbers of positive and negative eigenvalues, with 0, 0, 2, or 4 eigenvalues zero for spherical, elliptic, Kleinbottle, and toroidal cases, respectively.
Zigzag structure of simple twofaced polyhedra
 Combinatorics, Probability & Computing 14
, 2005
"... A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on opposite edges. A graph without a railroad is called tight. ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on opposite edges. A graph without a railroad is called tight. We consider the zigzag and railroad structures of general 3valent plane graph and, especially, of simple twofaced polyhedra, i.e., 3valent 3polytopes with only agonal and bgonal faces, where 3 ≤ a < b ≤ 6; the main cases are (a,b) = (3,6), (4,6) and (5,6) (the fullerenes). We completely describe the zigzag structure for the case (a,b)=(3,6). For the case (a,b)=(4,6) we describe symmetry groups, classify all tight graphs with simple zigzags and give the upper bound 9 for the number of zigzags in general tight graphs. For the remaining case (a,b)=(5,6) we give a construction realizing a prescribed zigzag structure.
GoldbergCoxeter Construction for 3 and 4valent Plane Graphs
, 2004
"... We consider the GoldbergCoxeter construction GC k,l (G 0 ) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a plane graph from any 3 or 4valent plane graph for integer parameters k, l.Azigzag in a plane graph is a circuit of ed ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We consider the GoldbergCoxeter construction GC k,l (G 0 ) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a plane graph from any 3 or 4valent plane graph for integer parameters k, l.Azigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face; a central circuit in a 4valent plane graph G is a circuit of edges, such that no two consecutive edges belong to the same face. We study the zigzag (or central circuit) structure of the resulting graph using the algebraic formalism of the moving group,the(k, l)product and a finite index subgroup of SL 2 (Z), whose elements preserve the above structure. We also study the intersection pattern of zigzags (or central circuits) of GC k,l (G 0 ) and consider its projections, obtained by removing all but one zigzags (or central circuits).
4valent plane graphs with 2, 3 and 4gonal faces, satellite conference (of congress
 of ISM in Beijing) on algebra and combinatorics
"... Call ihedrite any 4valent nvertex plane graph, whose faces are 2, 3 and 4gons only and p2+p3 = i. The edges of an ihedrite, as of any Eulerian plane graph, are partitioned by its central circuits, i.e. those, which are obtained by starting with an edge and continuing at each vertex by the edg ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Call ihedrite any 4valent nvertex plane graph, whose faces are 2, 3 and 4gons only and p2+p3 = i. The edges of an ihedrite, as of any Eulerian plane graph, are partitioned by its central circuits, i.e. those, which are obtained by starting with an edge and continuing at each vertex by the edge opposite the entering one. So, any ihedrite is a projection of an alternating link, whose components correspond to its central circuits. Call an ihedrite irreducible, if it has no railroad, i.e. a circuit of 4gonal faces, in which every 4gon is adjacent to two of its neighbors on opposite edges. We present the list of all ihedrites with at most 15 vertices. Examples of other results: (i) All ihedrites, which are not 3connected, are identified. (ii) Any irreducible ihedrite has at most i − 2 central circuits. (iii) All ihedrites without selfintersecting central circuits are listed. (iv) All symmetry group of ihedrites are listed.
Fullerenes and Coordination Polyhedra versus HalfCubes Embeddings
, 1997
"... A fullerene F n is a 3regular (or cubic) polyhedral carbon molecule for which the n vertices  the carbons atoms  are arranged in 12 pentagons and ( n 2 \Gamma 10) hexagons. Only a finite number of fullerenes are expected to be, up to scale, isometrically embeddable into a hypercube. Looking fo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A fullerene F n is a 3regular (or cubic) polyhedral carbon molecule for which the n vertices  the carbons atoms  are arranged in 12 pentagons and ( n 2 \Gamma 10) hexagons. Only a finite number of fullerenes are expected to be, up to scale, isometrically embeddable into a hypercube. Looking for the list of such fullerenes, we first check the embeddability of all fullerenes F n for n ! 60 and of all preferable fullerenes C n for n ! 86 and their duals. Then, we consider some infinite families, including fullerenes with icosahedral symmetry, which describe virus capsids, onionlike metallic clusters and geodesic domes. Quasiembeddings and fullerene analogues are considered. We also present some results on chemically relevant polyhedra such as coordination polyhedra and cluster polyhedra. Finally we conjecture that the list of known embeddable fullerenes is complete and present its relevance to the Katsura model for vesicles cells. Contents 1 Introduction and Basic Properties 2 1...
Zigzag structure of complexes
, 2008
"... Inspired by Coxeter’s notion of Petrie polygon for dpolytopes (see [Cox73]), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigzag structure for several interesting families of dpolytopes, including semiregular, regularfaced, Wythoff Archimedean ones, C ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Inspired by Coxeter’s notion of Petrie polygon for dpolytopes (see [Cox73]), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigzag structure for several interesting families of dpolytopes, including semiregular, regularfaced, Wythoff Archimedean ones, Conway’s 4polytopes, halfcubes, folded cubes. Also considered are regular maps and Lins triality relations on maps.
On kresonant fullerene graphs ∗
, 801
"... A fullerene graph F is a 3connected plane cubic graph with exactly 12 pentagons and the remaining hexagons. Let M be a perfect matching of F. A cycle C of F is Malternating if the edges of C appear alternately in and off M. A set H of disjoint hexagons of F is called a resonant pattern (or sextet ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A fullerene graph F is a 3connected plane cubic graph with exactly 12 pentagons and the remaining hexagons. Let M be a perfect matching of F. A cycle C of F is Malternating if the edges of C appear alternately in and off M. A set H of disjoint hexagons of F is called a resonant pattern (or sextet pattern) if F has a perfect matching M such that all hexagons in H are Malternating. A fullerene graph F is kresonant if any i (0 ≤ i ≤ k) disjoint hexagons of F form a resonant pattern. In this paper, we prove that every hexagon of a fullerene graph is resonant and all leapfrog fullerene graphs are 2resonant. Further, we show that a 3resonant fullerene graph has at most 60 vertices and construct all nine 3resonant fullerene graphs, which are also kresonant for every integer k> 3. Finally, sextet polynomials of the 3resonant fullerene graphs are computed.