✦ LIBER ✦

Large set of P3-decompositions

✍ Scribed by Qingde Kang; Yanfang Zhang

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 113 KB
Volume: 10
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.10008

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λ__K__~n~ into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P~3~,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10008

📜 SIMILAR VOLUMES

On large sets of Pk-decompositions

✍ Yanfang Zhang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB 👁 1 views

Let G ¼ ðVðGÞ; EðGÞÞ be a graph. A ðv v v; G; Þ-GD is a partition of all the edges of LGD. In this paper, we obtain a general result by using the finite fields, that is, if q ! k ! 2 is an odd prime power, then there exists a ðq; P k ; k À 1Þ-LGD.

On large sets of almost Hamilton cycle d

On large sets of almost Hamilton cycle decompositions

✍ Hongtao Zhao; Qingde Kang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB 👁 1 views

## Abstract A large set of __CS__(__v__, __k__, λ), __k__‐cycle system of order __v__ with index λ, is a partition of all __k__‐cycles of __K__~__v__~ into __CS__(__v__, __k__, λ)s, denoted by __LCS__(__v__, __k__, λ). A (__v__ − 1)‐cycle is called almost Hamilton. The completion of the existence s

Decompositions of Difference Sets

✍ Dieter Jungnickel; Vladimir D Tonchev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 122 KB

We characterize those symmetric designs with a Singer group G which admit a quasi-regular G-invariant partition into strongly induced symmetric subdesigns. In terms of the corresponding difference sets, the set associated with the larger design can be decomposed into a difference set describing the

P4-decompositions of regular graphs

✍ Heinrich, Katherine; Liu, Jiping; Yu, Minli 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

In this article, we show that every simple r-regular graph G admits a balanced P 4 -decomposition if r ≡ 0(mod 3) and G has no cut-edge when r is odd. We also show that a connected 4-regular graph G admits a P 4 -decomposition if and only if |E(G)| ≡ 0(mod 3) by characterizing graphs of maximum degr

(p, q)-completability of disk-decomposit

(p, q)-completability of disk-decompositions, II

✍ Mirko Horňák 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

Large Finite Sets

✍ Herman Ruge Jervell 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB