This paper presents a new numerical method for the solution of ordinary differential equations (ODE). The linear second-order equations considered herein are solved using operational matrices of Wang-Ball Polynomials. By the improvement of the operational matrix, the singularity of the ODE is removed, hence ensuring that a solution is obtained. In order to show the employability of the method, several problems were considered. The results indicate that the method is suitable to obtain accurate solutions.

Basketball is one of the most popular and popular games that have a large audience both globally and locally because of the magic it contains in terms of performance. For this sport to be a success, fundamental factors must exist and these factors is the referee. The referee plays a large and important role in the success of the game and the establishment and application of rules.The research aimed at identifying the effect of special on the development of referee's physical abilities. The researcher used the experimental method. The subjects were (12) first class basketball referees. The researcher recommended using special exercises due to their great role in developing the physical abilities of first class basketball referees

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

This paper proves the existence of face antimagic labeling for double duplication of barycentric subdivision of cycle and some other graphs 

In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.