Cluster automorphism groups and automorphism groups of exchange graphs
نویسندگان
چکیده
منابع مشابه
AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملAutomorphism groups of graphs
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets. Keywords—Automorphism groups of graphs; Cayley graphs; transposition sets.
متن کاملGeometric automorphism groups of graphs
Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for drawing graphs symmetrically based on group theory. More formally, we define an n-geometric automorphism group as a subgroup of the automorphism group of a graph that can be displayed as symmetries of a drawing of the graph in n dimensions. Then we present an algorithm to find all 2and 3-geometric a...
متن کاملAutomorphism Groups of Planar Graphs
By Frucht’s Theorem, every abstract finite group is isomorphic to the automorphism group of some graph. In 1975, Babai characterized which of these abstract groups can be realized as automorphism groups of planar graphs. In this paper, we give a more detailed description of these groups in two steps. First, we describe stabilizers of vertices in connected planar graphs as the class of groups cl...
متن کاملAutomorphism Groups of Comparability Graphs
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension dim(X) of a comparability graph X is the dimension of any transitive orientation of X, and by k-DIM we denote the class of comparability graphs X with dim(X) ≤ k. It is known that the complements of comparability gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2020
ISSN: 1945-5844,0030-8730
DOI: 10.2140/pjm.2020.307.283