A Classification of Symmetric Graphs of Order 3p
نویسندگان
چکیده
منابع مشابه
Classifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملA classification of symmetric graphs of order 30
Let r be a simple undirected graph and G a subgroup of Aut r. r is said to be G-symmetric, if G acts transitively on the set of ordered adjacent pairs of vertices of r; r is said to be symmetric if it is Autrsymmetric. In this paper we give a complete classification for symmetric graphs of order 30. (See Theorem 10.)
متن کاملClassification of trivalent symmetric graphs of small order
CLASSIFICATION OF TRIVALENT SYMMETRIC GRAPHS OF SMALL ORDER Marston Conder and Margaret Morton Department of Mathematics University of Auckland Private Bag 92019 Auckland NEW ZEALAND A classification is given of all finite connected trivalent symmetric graphs on up to 240 vertices, based on an analysis of short relators in their automorphism groups. SUBJECT CLASSIFICATION 05C25(Primary) 20F05(S...
متن کاملthe innovation of a statistical model to estimate dependable rainfall (dr) and develop it for determination and classification of drought and wet years of iran
آب حاصل از بارش منبع تأمین نیازهای بی شمار جانداران به ویژه انسان است و هرگونه کاهش در کم و کیف آن مستقیماً حیات موجودات زنده را تحت تأثیر منفی قرار می دهد. نوسان سال به سال بارش از ویژگی های اساسی و بسیار مهم بارش های سالانه ایران محسوب می شود که آثار زیان بار آن در تمام عرصه های اقتصادی، اجتماعی و حتی سیاسی- امنیتی به نحوی منعکس می شود. چون میزان آب ناشی از بارش یکی از مولفه های اصلی برنامه ...
15 صفحه اولPentavalent symmetric graphs of order 2pq
A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, a complete classification of connected pentavalent symmetric graphs of order 12p is given for each prime p. As a result, a connected pentavalent symmetric graph of order 12p exists if and only if p = 2, 3, 5 or 11, and up to isomorphism, there are only nine such graphs: one for each p = 2, 3 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1993
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1037