A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

An analytical form of the ground state charge density distributions
for the low mass fp shell nuclei ( 40  A  56 ) is derived from a
simple method based on the use of the single particle wave functions
of the harmonic oscillator potential and the occupation numbers of
the states, which are determined from the comparison between theory
and experiment.
For investigating the inelastic longitudinal electron scattering form
factors, an expression for the transition charge density is studied
where the deformation in nuclear collective modes is taken into
consideration besides the shell model space transition density. The
core polarization transition density is evaluated by adopting the
shape of Tassie mod

 An analytical form of the ground state charge density distributions
for the low mass fp shell nuclei ( 40  A  56 ) is derived from a
simple method based on the use of the single particle wave functions
of the harmonic oscillator potential and the occupation numbers of
the states, which are determined from the comparison between theory
and experiment.
For investigating the inelastic longitudinal electron scattering form
factors, an expression for the transition charge density is studied
where the deformation in nuclear collective modes is taken into
consideration besides the shell model space transition density. The
core polarization transition density is evaluated by adopting the
shape of Tass

The problem of finding the cyclic decomposition (c.d.) for the groups ), where  prime upper than 9 is determined in this work. Also, we compute the Artin characters (A.ch.) and Artin indicator (A.ind.) for the same groups, we obtain that after computing the conjugacy classes, cyclic subgroups, the ordinary character table (o.ch.ta.) and the rational valued character table for each group.

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

Abstract

 The issue of inequality in distribution of income and / or consumption expenditure is related to economic welfare because there is an inverse relationship between the economic welfare on the one hand, and the degree of inequality, on the other hand. Despite the fact that inequality is considered as normal phenomenon in every society, but if it exceeded certain limits it will lead to undesirable economic, social and political consequences. Therefore, the availability of indicators about inequality is a necessary tool for planning and evaluation of economic development programs. So, current study is aiming at measuring and analyzing the degree of inequality in distribution of consumpti

Background. Aneurysms of the distal anterior cerebral artery (DACA) are uncommon; they often form near the pericallosal-callosomarginal junction and are typically small. To our knowledge, giant DACA aneurysms developing from the more distant parts of the anterior cerebral artery (ACA), A4-5, have been described only once in the literature. Case description. A 66-year-old gentleman reported with a brief loss of consciousness followed by weakness in his right lower leg. The patient was admitted with a Glasgow Coma Score (GCS) of 15. A computed tomography (CT) scan of the head revealed a left hyperdense mass in the frontal parasagittal supracallosal region. Contrast MRI revealed a heterogeneously enhancing mass measuring 35x30x25 mm. C

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.

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 local resolving neighborhood  of a pair of vertices  for  and  is if there is a vertex  in a connected graph  where the distance from  to  is not equal to the distance from  to , or defined by . A local resolving function  of  is a real valued function   such that  for  and . The local fractional metric dimension of graph  denoted by , defined by  In this research, the author discusses about the local fractional metric dimension of comb product are two graphs, namely graph  and graph , where graph  is a connected graphs and graph  is a complate graph &