✦ LIBER ✦

Star factorizations of graph products

✍ Scribed by Darryn E. Bryant; Saad I. El-Zanati; Charles Vanden Eynden

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 94 KB
Volume: 36
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200102)36:2<59::aid-jgt1>3.0.co;2-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balanced bipartite graphs may be complet

Balanced bipartite graphs may be completely star-factored

✍ Nigel Martin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

We conclude the study of complete K1,q-factorizations of complete bipartite graphs of the form Kn,n and show that, so long as the obvious Basic Arithmetic Conditions are satisfied, such complete factorizations must exist.

Star partitions of graphs

✍ Egawa, Y.; Kano, M.; Kelmans, Alexander K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB 👁 2 views

Let G be a graph and n ≥ 2 an integer. We prove that the following are equivalent: (i) there is a partition , and (ii) for every subset S of V (G), G \ S has at most n|S| components with the property that each of their blocks is an odd order complete graph.

Tenacity of complete graph products and

Tenacity of complete graph products and grids

✍ Choudum, S. A.; Priya, N. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB

Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured by various parameters like connectivity, toughness, integrit

Hamiltonian-laceability of star graphs

✍ Sun-Yuan Hsieh; Gen-Huey Chen; Chin-Wen Ho 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

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

On 2-factors of a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 2 views

In this article, we consider the following problem: Given a bipartite graph G and a positive integer k, when does G have a 2-factor with exactly k components? We will prove that if , then, for any bipartite graph H = (U 1 , U 2 ; F ) with |U 1 | ≤ n, |U 2 | ≤ n and ∆(H) ≤ 2, G contains a subgraph i