✦ LIBER ✦

The number of minimally connected block designs

✍ Scribed by David Birkes; Yadolah Dodge

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 678 KB
Volume: 4
Category: Article
ISSN: 0167-9473
DOI: 10.1016/0167-9473(86)90007-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal block designs with minimal numbe

Optimal block designs with minimal number of observations

✍ R.B. Bapat; A. Dey 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Minimum number of experimental units in

Minimum number of experimental units in connected block designs with certain additional properties

✍ Jerzy K. Baksalary; Jan Hauke 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 610 KB

The number of vertices of degree k in a

The number of vertices of degree k in a minimally k-edge-connected digraph

✍ Yuan Xu-dong; Kang Liying; Cai Mao-cheng 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 298 KB 👁 2 views

Let k be a positive integer, and D = (V (D), E(D)) be a minimally k-edge-connected simple digraph. We denote the outdegree and indegree of x ∈ V (D) by δ D (x) and ρ D (x), respectively. Let u + (D) denote the number of vertices W. Mader asked the following question in [Mader, in Paul Erdös is Eigh

The Number of Vertices of Degree k in a

The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph

✍ M.C. Cai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Construction of Equi-replicated Balanced

Construction of Equi-replicated Balanced Block Designs with Block Sizes Exceeding the Number of Treatments

✍ Dr. B. Ceranka; Dr. S. Mejza 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 1 views

Connected graphs with a minimal number o

Connected graphs with a minimal number of spanning trees

✍ N Gaffke 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 743 KB