Geodesic
Methods of Destroying the Symmetries of a Graph
Bulletin of the Malaysian Mathematical Society, Tome 24 (2001) no. 2 Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website

Voir la notice de l'article

A note v of a graph G is called fixed if every automorphism of G sends v onto itself. A graph or digraph or other graphical structure is then called fixed if every node is fixed, i.e., its automorphism group is the identity. We present several methods for fixing a graph (destroying its automorphisms). These may not work for all graphs. The methods include orienting some of the edges, coloring some of the nodes with one or more colors and the same for the edges, labeling nodes or edges, and adding or deleting nodes or edges. These considerations lead to a multitude of new invariants and open questions. 
@article{BMMS_2001_24_2_a6,
     author = {Frank Harary},
     title = {Methods of {Destroying} the {Symmetries
}                        of a {Graph}},
     journal = {Bulletin of the Malaysian Mathematical Society},
     year = {2001},
     volume = {24},
     number = {2},
     url = {http://geodesic.mathdoc.fr/item/BMMS_2001_24_2_a6/}
}
TY  - JOUR
AU  - Frank Harary
TI  - Methods of Destroying the Symmetries
                        of a Graph
JO  - Bulletin of the Malaysian Mathematical Society
PY  - 2001
VL  - 24
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/BMMS_2001_24_2_a6/
ID  - BMMS_2001_24_2_a6
ER  - 
%0 Journal Article
%A Frank Harary
%T Methods of Destroying the Symmetries
                        of a Graph
%J Bulletin of the Malaysian Mathematical Society
%D 2001
%V 24
%N 2
%U http://geodesic.mathdoc.fr/item/BMMS_2001_24_2_a6/
%F BMMS_2001_24_2_a6
Frank Harary. Methods of Destroying the Symmetries
                        of a Graph. Bulletin of the Malaysian Mathematical Society, Tome 24 (2001) no. 2. http://geodesic.mathdoc.fr/item/BMMS_2001_24_2_a6/