Clusters of cycles

Abstract: A {it cluster of cycles} (or {it

(r, q)

-polycycle}) is a simple planar 2--co nnected finite or countable graph

G

of girth

r

and maximal vertex-degree

q

, which admits {it

(r, q)

-polycyclic realization} on the plane, denote it by

P (G)

, i.e. such that: (i) all interior vertices are of degree

q

, (ii) all interior faces (denote their number by

p_{r}

) are combinatorial

r

-gons and (implied by (i), (ii)) (iii) all vertices, edges and interior faces form a cell-complex. An example of

(r, q)

-polycycle is the skeleton of

(r^{q})

, i.e. of the

q

-valent partition of the sphere

S^{2}

, Euclidean plane

R^{2}

or hyperbolic plane

H^{2}

by regular

r

-gons. Call {it spheric} pairs

(r, q) = (3, 3), (3, 4), (4, 3), (3, 5), (5, 3)

; for those five pairs

P (r^{q})

is

(r^{q})

without the exterior face; otherwise

P (r^{q}) = (r^{q})

. We give here a compact survey of results on

(r, q)

-polycycles.

Review text

An \((r,q)\)-polycycle is a simple planar 2-connected finite or countable graph \(G\) of girth \(r\) and maximal vertex-degree \(q\), which admits an \((r,q)\)-polycyclic realization \(P(G)\) on the plane. Such a realization has the following characteristics: (i) all interior vertices are of degree \(q\); (ii) all interior faces (denote their number by \(p_r\)) are combinatorial \(r\)-gons; (iii) all vertices, edges and interior faces form a cell-complex. An example of an \((r,q)\)-polycycle is the skeleton of \((r^q)\), i.e., of the \(q\)-valent partition of the sphere, Euclidean plane or hyperbolic plane by regular \(r\)-gons. This paper gives a compact survey of results on \((r,q)\)-polycycles. Call a polycycle proper if it is a partial subgraph of \((r^q)\) and helicene, otherwise. The authors listed the \((4,3)\)-, \((3,4)\)-helicenes and the number of \((5,3)\)-, \((3,5)\)-helicenes for first interesting \(p_r\). They also obtained results about outerplanar polycycles. Call a polycycle \(G\) isotoxal (IT), isogonal (IG), or isohedral (IH) if its symmetric group \(\text{Aut}(G)\) is transitive on edges, vertices, or interior faces, respectively. The authors listed all IG- or IH-polycycles for spheric \((r,q)\) and constructed many examples of IH-polycycles for the general case. They also determined some interesting properties of these classes of polycycles. The authors found for the spheric \((r,q)\) the maximal number \(n_{\text{int}}\) of interior points for an \((r,q)\)-polycycle with given \(p_r\). They also found all non-extendible \((r,q)\)-polycycles. Finally the authors discussed problems concerning isometric embeddings of polycycles into hypercubes, half-hypercubes and cubic lattices and its half when the polycycles are infinite.

Recommendations

Cited in

(13)

This page was built for publication: Clusters of cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1602420)