✦ LIBER ✦

The semiregular polytopes

✍ Scribed by G. Blind; R. Blind

Book ID: 110558094
Publisher: European Mathematical Society
Year: 1991
Tongue: English
Weight: 191 KB
Volume: 66
Category: Article
ISSN: 0010-2571
DOI: 10.1007/bf02566640

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semiregular polytopes and amalgamated C-

Semiregular polytopes and amalgamated C-groups

✍ B. Monson; Egon Schulte 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 845 KB

SEMIREGULAR POLYHEDRA

✍ Rick N. Blake and Charles Verhille 📂 Article 📅 1982 🏛 National Council of Teachers of Mathematics ⚖ 757 KB

Semiregular Large Sets

✍ Charles A. Cusack; Spyros S. Magliveras 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 53 KB

Finitep′-Semiregular Groups

✍ P. Fleischmann; W. Lempken; P.H. Tiep 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 349 KB

In doing so he also gave a full description of those finite groups which have a Ž . Ž . representation D over ‫ރ‬ such that D g has no eigenvalue 1 for any nontrivial element g g G. In our terminology such a group is called w x Ž . semiregular. One of the results in 17 characterizes SL 5 as the only

Semiregular variables in the solar neigh

Semiregular variables in the solar neighbourhood

✍ I. S. Glass; F. Van Leeuwen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 810 KB

On the connectivity of semiregular cages

✍ C. Balbuena; D. González-Moreno; X. Marcote 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract An ({__r__, __r__ + 1}; __g__)‐cage is a graph with degree set {__r__, __r__ + 1}, girth __g__, and with the smallest possible order; every such graph is called a semiregular cage. In this article, semiregular cages are shown to be maximally edge‐connected and 2‐connected. As a conseque