Clusters of Cycles

Details Clusters of Cycles Clusters of Cycles

2001-04-07

arxiv.org/abs/math/0104090v1

Mathematics

Metric Geometry

21. to in appear in Journal of Geometry and Physics

Scientific paper

10.1016/S0393-0440(01)00040-7

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.

Affiliated with

Also associated with

No associations

Rating

Clusters of Cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clusters of Cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clusters of Cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-201370