In this paper, we obtain a properly posed set of nodes for interpolation on a sphere. Moreover it is applied to construct properly posed set of nodes for Lagran
The total chromatic number χT(G) of a graph G is the minimum number of colors needed to color the elements(vertices and edges) of G such that no adjacent or in
We study some approximation properties of Lagrange interpolation polynomial based on the zeros of (1 -x2)cosnarccosx. By using a decomposition for f(x) ∈ CrCr+