✦ LIBER ✦

Polynomial approximation on graphs

✍ Scribed by A. G. O'Farrell; K. J. Preskenis; D. Walsh

Publisher: Springer
Year: 1983
Tongue: English
Weight: 341 KB
Volume: 266
Category: Article
ISSN: 0025-5831
DOI: 10.1007/bf01458705

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial Approximation and Graph-Color

Polynomial Approximation and Graph-Coloring

✍ V. Th. Paschos 📂 Article 📅 2003 🏛 Springer Vienna 🌐 English ⚖ 568 KB

Polynomials on graphs

✍ Paul M. Weichsel 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Let G be a simple graph with adjacency matrix A, and p(x) a polynomial with rational coefficients. If p(A) is the adjacency matrix of a graph, we denote that graph by p(G). We consider the question: Given a graph 6, which polynomials p(r) give rise to a graph p(G) and what are those graphs? We give

Best polynomial approximation and Bernst

Best polynomial approximation and Bernstein polynomial approximation on a simplex

✍ Z. Ditzian 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 471 KB

Polynomial Approximation of Functions on

✍ Vladimir V. Andrievskii; Hans-Peter Blatt 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 334 KB

More on Comonotone Polynomial Approximat

More on Comonotone Polynomial Approximation

✍ D. Leviatan; I. A. Shevchuk 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 68 KB

A polynomial of graphs on surfaces

✍ Béla Bollobás; Oliver Riordan 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 134 KB