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.

In this paper we have made different regular graphs by using block designs. In one of our applicable methods, first we have changed symmetric block designs into new block designs by using a method called a union method. Then we have made various regular graphs from each of them. For symmetric block designs with  (which is named finite projective geometry), this method leads to infinite class of regular graphs. With some examples we will show that these graphs can be strongly regular or semi-strongly regular. We have also propounded this conjecture that if two semi-symmetric block designs are non-isomorphic, then the resultant block graphs of them are non-isomorphic, too.

The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that  may be infinite. Furthermore, we offered some properties of  such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.

The need for information web-searching is needed by many users nowadays. They use the search engines to input their query or question and wait for the answer or best search results. As results to user query the search engines many times may be return irrelevant pages or not related to information need. This paper presents   a proposed model to provide the user with efficient and effective result through search engine, based on modified chicken swarm algorithm  and cosine similarity    to eliminate and delete irrelevant pages(outliers) from the ranked list results, and to improve the results of the user's query   . The proposed model is applied to Arabic dataset and use the ZAD corpus dataset for 27

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

have been notable developments in the field of
r.ldical education in the country and in the region.
The most significant of which is a general awarness
that has been created about the need for and
relevance of changes.There is however a basic
question that posses itself and becomes clearly
relevant
in the context of effort .Today, to recognize health
care services in the developing countries in the light
of realigned priorities This ensure to bring about
learning outcomes as a tocurriculum changes to meet
this demand.

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.

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds