File:Schläfli graph.svg
Size of this PNG preview of this SVG file: 600 × 600 pixels. Other resolutions: 240 × 240 pixels | 480 × 480 pixels | 768 × 768 pixels | 1,024 × 1,024 pixels | 2,048 × 2,048 pixels.
Original file (SVG file, nominally 800 × 800 pixels, file size: 13 KB)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description |
English: Schläfli graph: a 9-sides symmetric embedding |
| Date | |
| Source | Own work |
| Author | Claudio Rocchini |
Many Thanks to nauty for autos.
Licensing
I, the copyright holder of this work, hereby publish it under the following licenses:
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
|
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License. |
You may select the license of your choice.
Source
C++ source code of graph generation: the graphs is generated as local graph of en:Gosset graph (relative to vertex 0). See construction of Gosset graph. For symmetric embedding I use nauty software.
const int NV = 27;
int i,k;
int cpt[8] = {-1,-1,-1,-1,-1,-1,3,3};
int vg[56][8];
std::vector<edge> edges;
int j = 0;
do {
for(i=0;i<8;++i) vg[j][i] = +cpt[i]; ++j;
for(i=0;i<8;++i) vg[j][i] = -cpt[i]; ++j;
}
while( std::next_permutation(cpt,cpt+8) );
int ren[56]; std::fill(ren,ren+56,-1); int lren = 0;
for(i=0;i<56-1;++i) for(j=i+1;j<56;++j) {
int x = 0; for(k=0;k<8;++k) x += vg[i][k]*vg[j][k];
if(x==8) {
if(i==0) { ren[j]=lren++; }
else if(ren[i]!=-1 && ren[j]!=-1)
edges.push_back( edge(ren[i],ren[j]) );
}
}
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 11:13, 30 July 2010 | | 800 × 800 (13 KB) | Rocchini | {{Information |Description={{en|1=Schläfli graph: a 9-sides symmetric embedding}} |Source={{own}} |Author=Claudio Rocchini |Date=2010-07-30 |Permission= |other_versions= }} |
File usage
The following pages on the English Wikipedia use this file (pages on other projects are not listed):
Global file usage
The following other wikis use this file:
- Usage on es.wikipedia.org
- Usage on fr.wikipedia.org
- Usage on ja.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on ta.wikipedia.org
- Usage on uk.wikipedia.org
- Usage on www.wikidata.org
