Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs

نویسندگان

  • Mathieu Dutour Sikiric
  • Michel Deza
چکیده

We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a plane graph from any 3or 4-valent plane graph for integer parameters k, l. 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 central circuit in a 4-valent 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 SL2(Z), whose elements preserve the above structure. We also study the intersection pattern of zigzags (or central circuits) of GCk,l(G0) and consider its projections, obtained by removing all but one zigzags (or central circuits).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Structure of Chemistry-relevant Graphs: zigzags and central circuits

Springer 2 This book is a companion to our book [DeDu08], which considered the notions of polycycles, face-regularity and weak face-regularity of plane graphs and toroidal maps. The central actors in the present monograph are the zigzags and central-circuits of 3-or 4-regular plane graphs, which allow to obtain a double covering or covering of the edge-set. This study is mainly focused on speci...

متن کامل

Zigzag Structures of Simple Two-Faced Polyhedra

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 3-valent plane graph and, especially, o...

متن کامل

Semi-Symmetric Graphs of Valence

A graph is semi-symmetric if it is regular and edge transitive but not vertex transitive. The 3and 4-valent semi-symmetric graphs are wellstudied. Several papers describe infinite families of such graphs and their properties. 3-valent semi-symmetric graphs have been completely classified up to 768 vertices. The goal of this project is to extend this work to 5-valent semi-symmetric graphs. In th...

متن کامل

On C-ultrahomogeneous graphs and digraphs

The notion of a C-ultrahomogeneous graph, due to Isaksen et al., is adapted for digraphs and studied for the twelve cubic distance transitive graphs, with C formed by g-cycles and (k − 1)-paths, where g = girth and k = arc-transitivity. Excluding the Petersen, Heawood and Foster (90 vertices) graphs, one can go further by considering the (k− 1)-powers of g-cycles under orientation assignments p...

متن کامل

On 4-valent Frobenius circulant graphs

A 4-valent first-kind Frobenius circulant graph is a connected Cayley graph DLn(1, h) = Cay(Zn, H) on the additive group of integers modulo n, where each prime factor of n is congruent to 1 modulo 4 and H = {[1], [h],−[1], −[h]} with h a solution to the congruence equation x + 1 ≡ 0 (mod n). In [A. Thomson and S. Zhou, Frobenius circulant graphs of valency four, J. Austral. Math. Soc. 85 (2008)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2004