Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the

The discussion in this paper gives several theorems and lemmas on the Sums of Squares of  consecutive Carol Numbers. These theorems are proved by using the definition of carol numbers and mathematical induction method. Here the matrix form and the recursive form of sum of squares of  consecutive Carol numbers is also given. The properties of the Carol numbers are also derived.

        This paper discusses the Sums of Squares of “m” consecutive Woodall Numbers. These discussions are made from the definition of Woodall numbers. Also learn the comparability of Woodall numbers and other special numbers. An attempt to communicate the formula for the sums of squares of ‘m’ Woodall numbers and its matrix form are discussed. Further, this study expresses some more correlations between Woodall numbers and other special numbers.

   For a finite group G, the intersection graph   of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph  of subgroups of the dihedral group  for distinct primes . We also find the mean distance of the graph  .

 An edge dominating set    of a graph  is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number  is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G.  The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

The aim of this research is to investigate the skills of the chemistry students from the Ibn Al-Haytham Education college of pure sciences in Baghdad in understanding and constructing graphical representations of data. The research sample consisted of (101) male and female students in their fourth year of study during the 2016-2017 academic year. This sample represents 71% of the total number of students in this group.The research methodology used consisted of two parts relating to 19 issues. The first part is an objective multi choice type of test to measure the student’s skill in selecting the right representation of specific subject graph amongst many provided. The second part concentrated on measuring the student’s skill in construc

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

بهذا البحث نقارن معاييرالمعلومات التقليدية (AIC , SIC, HQ , FPE ) مع معيارمعلومات الانحراف المحور (MDIC) المستعملة لتحديد رتبة انموذج الانحدارالذاتي (AR) للعملية التي تولد البيانات,باستعمال المحاكاة وذلك بتوليد بيانات من عدة نماذج للأنحدارالذاتي,عندما خضوع حد الخطأ للتوزيع الطبيعي بقيم مختلفة لمعلماته

     Let G be a finite group and X be a G-conjugacy of elements of order 3. The A4-graph of G is a simple graph with vertex set X and two vertices x,yÎX are linked if x≠ y and xy^-1 is an involution element. This paper aims to investigate  the A4-graph properties for the monster  Held group He.