𝔖 Bobbio Scriptorium
✦   LIBER   ✦

l-Regular rotations of the countably infinite complete graph

✍ Scribed by Mark Jungerman


Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
998 KB
Volume
20
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


All

WWV .

I-regular rotation of the infinite complete graph with countable vertex set is one in induced circuit is finite of kngth 1. I-regular rotations are exhibited for all 1 a 3. which Triangular rotations of finite graphs have been extensively studied. In particular, finding such rotations for complete graphs is instrumental in the proof of the Heawood conjecture.. This leads to the question of finding triangular rotations of infinite graphs. Ringe4 ([3], Chap. 12) posed the problem of constructing a triangular rotation fork,, the graph with countabie vertex set in which each pair of distinct vertices is adjacent. The regularity of triangular rotations suggests the following generalization. Let an I-regular rotation of a graph be one for which all the induced circuits have length 1. In this paper, Z-regular rotations of K, are constructed for all 1 3 3.

Let S be a countably infinrte set. A rotario~r 4 of K, is an assignment to each i E S of a cyclic permutation 4i acting on S -{i}. For distinct i and j in S, the circuit from i to j induced by a given fotation 4 is the sequence obtained as follows. Let &P=iaP= j. For k >1, uk = 4at.,(~k -2). For k CO, ak = &i+,(ak+& Let 1 be the smallest positive integer, if one exists, such that al = i and al+ 1 = j. Then the circuit is said to be finite of length I. If no such I exists the circuit is said to be infinite. If for every djstirxt i and j in S the circuit from i to j is of length I, 4 witl be eailed ic -regular.

Suppose I' is a countably L%ite group, fvhich for convenience will be assumed to be abelian+ L& cr be a cyclic permutation of r -{O}, where 0 is the identity in r.

'I%en the assignment to each y E 1" of the permutation 4: delined via @T(S) = y + ~$8 -y ), S# y, is easily checked to constitute a rotation 4b" of Km. 4 a is said to be generated from CT by the addirk rule. cr witJ be said to satisfy At(p) if the circuit from 0 to p induced by 4" is of length 1. Suppose CT satisfies A, (0) and the circuit from 0 to fl is au = O,a, = @, uzta3,. . ,at = 0. Then by definition & = t#i~_*(ak"2) = i&k-$ + +&-a -Qli-1) &hich implies ak +cr = at._1 4~ CM +t ~(a~+ + cx -(tzkwI + a))= 4~k__1+Q{u4-2 + cw) for any (Y E r. Thus if c satisfies;

,& (@)$ then for any CY E r, the circuit induced from CT to a + p is of length J. irr $aq, if CI satisfies AI(p) for at1 0 E f -{O}, then 4" is 1 -regular.


πŸ“œ SIMILAR VOLUMES


The achromatic indices of the regular co
✍ Nam-Po Chiang; Hung-Lin Fu πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 272 KB

In this paper, we study the achromatic indices of the regular complete multipartite graphs and obtain the following results: (1) A good upper bound for the achromatic index of the regular complete multipartite graph which gives the exact values of an infinite family of graphs and solves a problem p

The star-arboricity of the complete regu
✍ Yasukazu Aoki πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 331 KB

A subgraph H of a graph G is called a star-subgraph if each component of H is a star. The star-arboricify of G, denoted by sa(G), is the minimum number of star-subgraphs that partition the edges of G. In this paper we show that sa(G) is [r/21 + 1 or [r/2] + 2 for the complete r-regular multipartite

On the Number of Nonisomorphic Orientabl
✍ Vladimir P. Korzhik; Heinz-Jurgen Voss πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 260 KB

In this paper we consider those 2-cell orientable embeddings of a complete graph K n+1 which are generated by rotation schemes on an abelian group 8 of order n+1, where a rotation scheme an 8 is defined as a cyclic permutation ( ; 1 , ; 2 , ..., ; n ) of all nonzero elements of 8. It is shown that t

The center of an infinite graph
✍ L. Boza; A. DiΓ‘nez; A. MΓ‘rquez πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 344 KB

In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give different characterizations of when a vertex is in the center of an infinite g

s-Regular cubic graphs as coverings of t
✍ Yan-Quan Feng; Jin Ho Kwak πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 138 KB

## Abstract A graph is __s‐regular__ if its automorphism group acts freely and transitively on the set of __s__‐arcs. An infinite family of cubic 1‐regular graphs was constructed in [10], as cyclic coverings of the three‐dimensional Hypercube. In this paper, we classify the __s__‐regular cyclic cov