|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Elementary elliptic $(R,q)$-polycycles | | Michel Deza
; Mathieu Dutour
; Mikhail Shtogrin
; | | Date: |
27 Jul 2005 | | Subject: | Combinatorics | math.CO | | Abstract: | We consider the following generalization of the decomposition theorem for polycycles. A {em $(R,q)$-polycycle} is, roughly, a plane graph, whose faces, besides some disjoint {em holes}, are $i$-gons, $i in R$, and whose vertices, outside of holes, are $q$-valent. Such polycycle is called {em elliptic}, {em parabolic} or {em hyperbolic} if $frac{1}{q} + frac{1}{r} - {1/2}$ (where $r={max_{i in R}i}$) is positive, zero or negative, respectively. An edge on the boundary of a hole in such polycycle is called {em open} if both its end-vertices have degree less than $q$. We enumerate all elliptic {em elementary} polycycles, i.e. those that any elliptic $(R,q)$-polycycle can be obtained from them by agglomeration along some open edges. | | Source: | arXiv, math.CO/0507562 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER