Topological Symmetry Groups of Complete Bipartite Graphs
نویسندگان
چکیده
منابع مشابه
Topological Symmetry Groups of Small Complete Graphs
Topological symmetry groups were originally introduced to study the symmetries of non-rigid molecules, but have since been used to study the symmetries of any graph embedded in R. In this paper, we determine for each complete graph Kn with n ≤ 6, what groups can occur as topological symmetry groups or orientation preserving topological symmetry groups of some embedding of the graph in R.
متن کاملTopological Symmetry Groups of Complete Graphs in the 3-sphere
The orientation preserving topological symmetry group of a graph embedded in the 3-sphere is the subgroup of the automorphism group of the graph consisting of those automorphisms which can be induced by an orientation preserving homeomorphism of the ambient space. We characterize all possible orientation preserving topological symmetry groups of embeddings of complete graphs in the 3-sphere.
متن کاملComplete Graphs whose Topological Symmetry Groups are Polyhedral
Characterizing the symmetries of a molecule is an important step in predicting its chemical behavior. Chemists have long used the group of rigid symmetries, known as the point group, as a means of representing the symmetries of a molecule. However, molecules which are flexible or partially flexible may have symmetries which are not included in the point group. Jon Simon [11] introduced the conc...
متن کاملTopological Drawings of Complete Bipartite Graphs
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been studied extensively in the context of crossing number problems. We consider a natural class of simple topological drawings of complete bipartite graphs, in ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tokyo Journal of Mathematics
سال: 2016
ISSN: 0387-3870
DOI: 10.3836/tjm/1459367261