aspersion
发表于 2025-3-25 06:50:15
Modelling Sleep and General Anaesthesia,We survey the results obtained by a large number of authors concerning the spectrum of a graph. The questions of characterisation by spectrum, cospectral graphs and information derived from the spectrum are discussed.
Orgasm
发表于 2025-3-25 10:00:26
https://doi.org/10.1007/978-1-4614-0173-5We prove Grant‘s conjecture that, for all graphs G and H with H ≇ K., the lexicographic product G is semi-stable at (v, w) if H is semi-stable at w. Thus we can conclude that G is semi-stable at (v, w) if and only if H is semi-stable at w.
细胞膜
发表于 2025-3-25 15:07:48
Sleep Disturbance During Military DeploymentThis paper uses circulant matrices, computer techniques and product designs to construct orthogonal designs in order 24.
anachronistic
发表于 2025-3-25 18:09:06
Computer-Assisted PolysomnographyLet p be a prime, p=4t−1, t≥2. A construction is given for a balanced incomplete block design with parameters (4t−1, (2t−1)(4t−1), (2t−1)., 2t−1, (2t−1)(t−1)), which contains no (4t−1, 2t−1, t−1) symmetric design.
淘气
发表于 2025-3-25 22:27:02
Some new constructions for orthogonal designs using circulants,In . Goethals and Seidel produced a matrix on . variables which has proved invaluable in the construction of orthogonal designs. In this paper the Goethals-Seidel matrix is generalized to construct orthogonal designs of large composite orders. An asymptotic result for . variable orthogonal designs of order ., where . is odd, is obtained.
忍耐
发表于 2025-3-26 02:39:28
http://reply.papertrans.cn/23/2300/229930/229930_26.png
Measured
发表于 2025-3-26 07:23:32
The semi-stability of lexicographic products,We prove Grant‘s conjecture that, for all graphs G and H with H ≇ K., the lexicographic product G is semi-stable at (v, w) if H is semi-stable at w. Thus we can conclude that G is semi-stable at (v, w) if and only if H is semi-stable at w.
薄荷醇
发表于 2025-3-26 10:57:29
http://reply.papertrans.cn/23/2300/229930/229930_28.png
雄辩
发表于 2025-3-26 12:37:17
On quasi-multiple designs,Let p be a prime, p=4t−1, t≥2. A construction is given for a balanced incomplete block design with parameters (4t−1, (2t−1)(4t−1), (2t−1)., 2t−1, (2t−1)(t−1)), which contains no (4t−1, 2t−1, t−1) symmetric design.
唠叨
发表于 2025-3-26 18:14:54
https://doi.org/10.1007/BFb0069176Counting; Kombinatorik; combinatorics; graph; mathematics; theorem