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.

Show the greatness of Allah Almighty when contemplating the benefits of trees and plants in
Life in general and trees mentioned in the Koran in particular, do not have to meditate that
He acknowledges the greatness of the Almighty Creator, and his preference over man, that he is prepared for his livelihood
And give him what he can do in this life to the fullest.
  The study also stressed the need to urge people to this great blessing trees
By preserving them and wasteful wastefulness.
  The study also pointed to the need to guide people towards the aesthetics and improvements of
Look through and enjoy the beauty of trees, flowers, greenery and fruits ..

            This paper is interested in certain  subclasses of univalent and bi-univalent functions concerning  to shell- like curves connected with k-Fibonacci numbers involving modified Sigmoid activation function θ(t)=2/(1+e^(-t) ) ,t ≥0 in unit disk |z|<1 . For estimating of the initial coefficients |c_2 | , |c_3 |, Fekete-Szego ̈ inequality and the  second Hankel determinant have been investigated for the functions in our classes. 

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

 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

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

Considering that migration is moving to live from one place to another, with an intention in the place that was intended for a long time, due to the frequent movement of individuals from one place to another, and due to the different purpose of migration, we find external migration classified into legalized and irregular migration, and the reasons The growth of illegal immigration is due to economic,  social, and psychological motives, and therefore we find that it has multiple effects, both on the country hosting immigrants in terms of economic, security, social and health terms, or on the level of organizing international relations between countries, so countries sought to mitigate this phenomenon and deal with immigrants As stipu

Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if  for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi

We consider some nonlinear partial differential equations in higher dimensions, the negative order of the Calogero-Bogoyavelnskii-Schiff (nCBS) equationin (2+1) dimensions, the combined of the Calogero-Bogoyavelnskii-Schiff equation and the negative order of the Calogero-Bogoyavelnskii-Schiff equation (CBS-nCBS) in (2+1) dimensions, and two models of the negative order Korteweg de Vries (nKdV) equations in (3+1) dimensions. We show that these equations can be reduced to the  same class of ordinary differential equations via wave reduction variable. Solutions in terms of symmetrical Fibonacci and Lucas functions are presented by implementation of the modified Kudryashov method.