✦ LIBER ✦

The existence of cubature formulas with the least possible number of nodes

✍ Scribed by V.A. Kuz'menkov

Publisher: Elsevier Science
Year: 1976
Weight: 381 KB
Volume: 16
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(76)90155-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof of the minimality of the number of

Proof of the minimality of the number of nodes in the cubature formula for a hypersphere

✍ I.P. Mysovskikh 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 691 KB

Bounds for the number of nodes in Chebys

Bounds for the number of nodes in Chebyshev type quadrature formulas

✍ Patrick Rabau; Bela Bajnok 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 815 KB

A particular case of the construction of

A particular case of the construction of cubature formulae with a boundary layer

✍ L.V. Voitishek 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 171 KB

Hamiltonian tournaments with the least n

Hamiltonian tournaments with the least number of 3-cycles

✍ M. Burzio; D. C. Demaria 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 2 views

## Abstract We characterize the family of hamiltonian tournaments with the least number of 3‐cycles, studying their structure and their score sequence. Furthermore, we obtain the number of nonisomorphic tournaments of this family.

A formula for computing the number of qu

A formula for computing the number of quadtree node fragments created by a shift

✍ Clifford A. Shaffer 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Graphs with given odd sets and the least

Graphs with given odd sets and the least number of vertices

✍ Louis Hakimi, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and Soltés: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.