Symmetric Bowtie Decompositions of the Complete Graph
نویسندگان
چکیده
Given a bowtie decomposition of the complete graph Kv admitting an automorphism group G acting transitively on the vertices of the graph, we give necessary conditions involving the rank of the group and the cycle types of the permutations in G. These conditions yield non–existence results for instance when G is the dihedral group of order 2v, with v ≡ 1, 9 (mod 12), or a group acting transitively on the vertices of K9 and K21. Furthermore, we have non–existence for K13 when the group G is different from the cyclic group of order 13 or for K25 when the group G is not an abelian group of order 25. Bowtie decompositions admitting an automorphism group whose action on vertices is sharply transitive, primitive or 1–rotational, respectively, are also studied. It is shown that if the action of G on the vertices of Kv is sharply transitive, then the existence of a G–invariant bowtie decomposition is excluded when v ≡ 9 (mod 12) and is equivalent to the existence of a G–invariant Steiner triple system of order v. We are always able to exclude existence if the action of G on the vertices of Kv is assumed to be 1–rotational. If, instead, G is assumed to act primitively then existence can be excluded when v is a prime power satisfying some additional arithmetic constraint.
منابع مشابه
H-Decompositions of r-graphs when H is an r-graph with exactly 2 edges
Given two r-graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H. The minimum number of parts in an H-decomposition of G is denoted by φH(G). By a 2-edge-decomposition of an r-graph we mean an H-decomposition for any fixed r-graph H with exactly 2 edges. In the special case where the two edges of...
متن کامل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 Hamilton Cycle Decompositions of Complete Graphs Minus a 1-Factor
Let n ≥ 2 be an integer. The complete graph Kn with a 1-factor F removed has a decomposition into Hamilton cycles if and only if n is even. We show that Kn − F has a decomposition into Hamilton cycles which are symmetric with respect to the 1-factor F if and only if n ≡ 2, 4 mod 8. We also show that the complete bipartite graph Kn,n has a symmetric Hamilton cycle decomposition if and only if n ...
متن کاملStrongly Balanced Four Bowtie Systems
A k-bowtie is the graph consisting of two cycles of lenght k, having exactly one vertex in common. A k-bowtie system of order v is a pair (X,B), where X is a finite set of v vertices and B is a collection of edge disjoint k-bowties (called blocks) which partitions the edge set of the complete graph Kn, defined in X. In this paper we study 4-bowtie systems. We determine the spectrum of all types...
متن کاملBi-cyclic decompositions of complete graphs into spanning trees
We examine decompositions of complete graphs with an even number of vertices, K2n, into n isomorphic spanning trees. While methods of such decompositions into symmetric trees have been known, we develop here a more general method based on a new type of vertex labelling, called flexible q-labelling. This labelling is a generalization of labellings introduced by Rosa and Eldergill.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010