AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
author
Abstract:
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 complexity indices of them (1973, 2001). In this paper, with a simple method, we calculate the automorphism group of some weighted graphs.
similar resources
The automorphism groups of non-edge-transitive rose window graphs
In this paper, we will determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this will complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we deter...
full textcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولQuantum automorphism groups of vertex - transitive graphs of order ≤ 11
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups Zn , symmetric groups Sn and quantum symmetric groups Qn , by using various product operations. The exceptional case is that of the Petersen graph, and we present some questions about it.
full textOn automorphism groups of quasiprimitive 2-arc transitive graphs
We characterize the automorphism groups of quasiprimitive 2-arc-transitive graphs of twisted wreath product type. This is a partial solution for a problem of Praeger regarding quasiprimitive 2-arc transitive graphs. The solution stimulates several further research problems regarding automorphism groups of edge-transitive Cayley graphs and digraphs.
full textAutomorphism 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.
full textLine-transitive Automorphism Groups of Linear Spaces
In this paper we prove the following theorem. Let S be a linear space. Assume that S has an automorphism group G which is line-transitive and point-imprimitive with k < 9. Then S is one of the following:(a) A projective plane of order 4 or 7, (a) One of 2 linear spaces with v = 91 and k = 6, (b) One of 467 linear spaces with v = 729 and k = 8. In all cases the full automorphism group Aut(S) is ...
full textMy Resources
Journal title
volume 2 issue None
pages 47- 54
publication date 2007-05
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023