𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fixed Points of Automorphisms of Graphs with 1 – Factorizations

✍ Scribed by Ulrike Baumann

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
191 KB
Volume
210
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

1-Factorizations of random regular graph
1-Factorizations of random regular graphs
✍ M. S. O. Molloy; H. Robalewska; R. W. Robinson; N. C. Wormald 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB 👁 2 views

It is shown that for each r G 3, a random r-regular graph on 2 n vertices is equivalent in a certain sense to a set of r randomly chosen disjoint perfect matchings of the 2 n vertices, as n ª ϱ. This equivalence of two sequences of probabilistic spaces, called contiguity, occurs when all events almo

Resolutions of PG(5, 2) with point-cycli
Resolutions of PG(5, 2) with point-cyclic automorphism group
✍ Jumela Sarmiento 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

A t-vY kY k design is a set of v points together with a collection of its k-subsets called blocks so that all subsets of t points are contained in exactly k blocks. The d-dimensional projective geometry over GFqY PGdY q, is a 2 À q d q dÀ1 Á Á Á q 1Y q 1Y 1 design when we take its points as the poin

A �-transitive graph of valency 4 with a
A �-transitive graph of valency 4 with a nonsolvable group of automorphisms
✍ Maru?i?, Dragan; Xu, Ming-Yao 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

A graph X is said to be 1 2 -transitive if its automorphism group acts transitively on the sets of its vertices and edges but intransitively on the set of its arcs. A construction of a 1 2 -transitive graph of valency 4 and girth 6 with a nonsolvable group of automorphism is given.

A degree condition for the existence of
A degree condition for the existence of regular factors inK1,n-free graphs
✍ Ota, Katsuhiro; Tokuda, Taro 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.