Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

Local Lp-Saturation Of Positive Linear Convolution Operators, J. J. Swetits, B. Wood Jan 1982

Local Lp-Saturation Of Positive Linear Convolution Operators, J. J. Swetits, B. Wood

Mathematics & Statistics Faculty Publications

Local Lp-saturation of positive linear convolution operators is investigated. Results are obtained for two important classes of operators previously studied by Bojanic, DeVore, Korovkin and the authors.


Unbounded Functions And Positive Linear-Operators, J. J. Swetits, B. Wood Jan 1982

Unbounded Functions And Positive Linear-Operators, J. J. Swetits, B. Wood

Mathematics & Statistics Faculty Publications

The approximation of unbounded functions by positive linear operators under multiplier enlargement is investigated. It is shown that a very wide class of positive linear operators can be used to approximate functions with arbitrary growth on the real line. Estimates are given in terms of the usual quantities which appear in the Shisha-Mond theorem. Examples are provided.


Smallest Cubic And Quartic Graphs With A Given Number Of Cutpoints And Bridges, Gary Chartrand, Farrokh Saba, John K. Cooper Jr., Frank Harary, Curtiss E. Wall Jan 1982

Smallest Cubic And Quartic Graphs With A Given Number Of Cutpoints And Bridges, Gary Chartrand, Farrokh Saba, John K. Cooper Jr., Frank Harary, Curtiss E. Wall

Mathematics & Statistics Faculty Publications

For positive integers b and c, with c even, satisfying the inequalities b+1≤c≤2b, the minimum order of a connected cubic graph with b bridges and c cutpoints is computed. Furthermore, the structure of all such smallest cubic graphs is determined. For each positive integer c, the minimum order of a quartic graph with c cutpoints is calculated. Moreover, the structure and number of all such smallest quartic graphs are determined.