Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs
โ Scribed by D. de Werra
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 322 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let [' be a distance regular graph with intersection array {bo, bl, . โข., bd\_l; ct, ..., ed}. It is shown that in same cases (c i 1, ai-I, br I) = (ct, at, bt) and (c2~ t, a2~ 1, b2i l) = (ci, a~, bi) imply k <\_ 2b i + 1. As a corollary all distance regular graphs of diameter d = 3i -1 with b I =
We present a formal and numerical comparison between the iterative and matrix-inversion approaches of the polarizable continuum model. The formal analysis shows completely the equivalence of the two approaches. Numerical equivalence is also recovered, introducing in both methods the proper boundary