Open AccessDestroying symmetry by orienting edges: Complete graphs and complete bigraphs
Author(s) -
Frank Harary,
Michael S. Jacobson
Publication year - 2001
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1139
Subject(s) - mathematics , combinatorics , graph automorphism , automorphism group , graph , symmetric graph , discrete mathematics , automorphism , line graph , voltage graph
Our purpose is to introduce the concept of determining the smallest number of edges of a graph which can be oriented so that the resulting mixed graph has the trivial automorphism group. We find that this number for complete graphs is related to the number of identity
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom