✦ LIBER ✦

The connectivity of the block-intersection graphs of designs

✍ Scribed by Donovan R. Hare; William Mc Cuaig

Publisher: Springer
Year: 1993
Tongue: English
Weight: 187 KB
Volume: 3
Category: Article
ISSN: 0925-1022
DOI: 10.1007/bf01389350

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Existential closure of block intersectio

Existential closure of block intersection graphs of infinite designs having infinite block size

✍ Daniel Horsley; David A. Pike; Asiyeh Sanaei 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

A graph G is n-existentially closed (n-e.c.) if for each pair (A,B) of disjoint subsets of V(G) with |A|+|B|≤n there exists a vertex in V(G)\(A∪B) which is adjacent to each vertex in A and to no vertex in B. In this paper we study the n-existential closure property of block intersection graphs of in

Cycles in the block-intersection graph o

Cycles in the block-intersection graph of pairwise balanced designs

✍ Donovan R. Hare 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 580 KB

It is shown that the block-intersection graph of a pairwise balance design with ),= l is edge-pancyclic given that its minimum block cardinality is at least 3.

Existential closure of block intersectio

Existential closure of block intersection graphs of infinite designs having finite block size and index

✍ David A. Pike; Asiyeh Sanaei 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

In this article we study the n-existential closure property of the block intersection graphs of infinite t-(v, k, k) designs for which the block size k and the index k are both finite. We show that such block intersection graphs are 2-e.c. when 2 ≤ t ≤ k-1. When k = 1 and 2 ≤ t ≤ k, then a necessary

The number of minimally connected block

The number of minimally connected block designs

✍ David Birkes; Yadolah Dodge 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 678 KB

The connectivity of line-graphs

✍ Gary Chartrand; M. James Stewart 📂 Article 📅 1969 🏛 Springer 🌐 English ⚖ 286 KB

The chromatic connectivity of graphs

✍ C. D. Godsil; R. Nowakowski; J. Nešetřil 📂 Article 📅 1988 🏛 Springer Japan 🌐 English ⚖ 291 KB