A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

The research aims to find approximate solutions for two dimensions Fredholm linear integral equation. Using the two-variables of the Bernstein polynomials we find a solution to the approximate linear integral equation of the type two dimensions. Two examples have been discussed in detail.

The study was carried out by reinforcing the resin matrix material

which was (Epoxy- Ep828) by useing Kevlar fibers and glass fibers type (E-gl ass) both or them in the form of woven roving and poly propylene tlbcrs  in  the form chopped  strand  mats.  wi th (30%)  volume  fraction. Some mechan i cal  properties of the were prepared composite specimens U ltraviolet   radiation  were  stuied   after   being  subjected  to  different weathering conditi ons i ncluded. Compression and hardness testing were carried out using Briel! method so as to compare between composite behavior i n the environments previously mentioned .

 <

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.

          A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does not dominate another color class. The minimum number of colors required in such a coloring of  is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.

0

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.