Geodesic
On the Möbius Ladders
Canadian mathematical bulletin, Tome 10 (1967) no. 4, pp. 493-496

Voir la notice de l'article provenant de la source Cambridge

DOI

Consider the graph Mn, where n = 2r ≥ 6, consisting of a polygonof length n and all n/2 chords joining opposite pairs of vertices. Thisgraph has 2r vertices which we denote by 1, 2, 3,..., 2r, and the 3r(undirected) edges We call Mn the n-ladder, defined thus far only for n even. Thethree smallest n-ladders with n even are shown in Figure 1. 
Guy, Richard K.; Harary, Frank. On the Möbius Ladders. Canadian mathematical bulletin, Tome 10 (1967) no. 4, pp. 493-496. doi: 10.4153/CMB-1967-046-4
@article{10_4153_CMB_1967_046_4,
     author = {Guy, Richard K. and Harary, Frank},
     title = {On the {M\"obius} {Ladders}},
     journal = {Canadian mathematical bulletin},
     pages = {493--496},
     year = {1967},
     volume = {10},
     number = {4},
     doi = {10.4153/CMB-1967-046-4},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1967-046-4/}
}
TY  - JOUR
AU  - Guy, Richard K.
AU  - Harary, Frank
TI  - On the Möbius Ladders
JO  - Canadian mathematical bulletin
PY  - 1967
SP  - 493
EP  - 496
VL  - 10
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1967-046-4/
DO  - 10.4153/CMB-1967-046-4
ID  - 10_4153_CMB_1967_046_4
ER  - 
%0 Journal Article
%A Guy, Richard K.
%A Harary, Frank
%T On the Möbius Ladders
%J Canadian mathematical bulletin
%D 1967
%P 493-496
%V 10
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1967-046-4/
%R 10.4153/CMB-1967-046-4
%F 10_4153_CMB_1967_046_4

Cité par Sources :