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 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

Density functional theory (DFT) with B3LYP level and 6-311G[Formula: see text] basis sets for light atoms like N and O and SDD basis sets for heavy atoms like Sn is used to examine the interaction of tin dioxide nanocrystals with nitrogen dioxide as a function of temperature from 273[Formula: see text]K to 373[Formula: see text]K through a Gaussian 09W software program. Gibbs free energy, enthalpy, and entropy of activation and reaction are calculated. The situation of transition of SnO₂ clusters toward nitrogen dioxide is investigated. According to the findings, the activation energy of SnO₂ clusters with nitrogen dioxide increases as the temperature rises (in negative value). Gauss view 0

Aromaticity, antiaromaticity and chemical bonding in the ground (S0), first singlet excited (S1) and lowest triplet (T1) electronic states of disulfur dinitride, S2N2, were investigated by analysing the isotropic magnetic shielding, σiso(r), in the space surrounding the molecule for each electronic state. The σiso(r) values were calculated by state-optimized CASSCF/cc-pVTZ wave functions with 22 electrons in 16 orbitals constructed from gauge-including atomic orbitals (GIAOs). The S1 and T1 electronic states were confirmed as 11Au and 13B3u, respectively, through linear response CC3/aug-cc-pVTZ calculations of the vertical excitation energies for eight singlet (S1–S8) and eight triplet (T1–T8) electronic states. The aromaticities of S

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 &

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .