Trivalent Symmetric Graphs of Order at most 120
نویسندگان
چکیده
منابع مشابه
5-valent Symmetric Graphs of Order at Most 100
1 "UI,J;:"~.VU.jJ of the automorphism group is said to be symmetric on r, a,U.llo,vuuv vertices of f; f is said (that is those groups act are vertex transitive and hence are The motivation for this paper came from Lorimer [1] about determining all minimal trivalent of order at most 120. Similar work for 5-valent the order of a cornpl.ete list of most 100. In stabilizer has upper bound that is 4...
متن کامل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...
متن کامل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.
متن کاملSymmetric Cubic Graphs of Girth at Most 7
By a symmetric graph we mean a graph X which automorphism group acts transitively on the arcs of X. A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Tutte [31, 32] showed that every finite symmetric cubic graph is s-regular for some s ≤ 5. It is well-known that there are precisely five symmetric cubic graphs of girth less than 6. All these graphs can be re...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1984
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(84)80030-x