| Title: | Crossing numbers of Sierpiński-like graphs |
|---|
| Authors: | ID Klavžar, Sandi (Author)
ID Mohar, Bojan (Author) |
|---|
| Files: |  http://www3.interscience.wiley.com/cgi-bin/jissue/112092843
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | PEF - Faculty of Education
|
|---|
| Abstract: | The crossing number of Sierpiński graphs ▫$S(n,k)$▫ and their regularizarions ▫$S^+(n,k)$▫ and ▫$S^{++}(n,k)$▫ are studied. Drawings of these graphs are presented and proved to be optimal for ▫$S^+(n,k)$▫ and ▫$S^{++}(n,k)$▫ for every ▫$n ge 1$▫ and ▫$k ge 1$▫. The crossing numbers of these graphs are expressed in terms of the crossing number of ▫$K_{k+1}$▫. These are the first nontrivial families of graphs of "fractal" type whose crossing number is known.
|
|---|
| Keywords: | matematika, teorija grafov, risanje grafov, prekrižno število, grafi Sierpińskega, avtomorfizmi grafov, mathematics, graf theory, graph drawing, crossing number, Sierpiński graphs, graph automorphism |
|---|
| Year of publishing: | 2005 |
|---|
| Number of pages: | str. 186-198 |
|---|
| Numbering: | Vol. 50, no. 3 |
|---|
| PID: | 20.500.12556/DKUM-51505  |
|---|
| UDC: | 519.173 |
|---|
| ISSN on article: | 0364-9024 |
|---|
| COBISS.SI-ID: | 13783897 |
|---|
| NUK URN: | URN:SI:UM:DK:KCOIB8OJ |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1581 |
|---|
| Downloads: | 88 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
