نتایج جستجو برای: molecular graph
تعداد نتایج: 827060 فیلتر نتایج به سال:
Randić index is one of the most famous topological graph indices. The energy a was defined more than four decades ago for its molecular applications. classical modeling molecule as sum absolute values all eigenvalues adjacency matrix corresponding to graph. There are several other versions notion obtained using types matrices. In this paper, we introducing and investigating type Hadi RHE(G) G, ...
We report here on recent developments in the characterization of molecular branching, molecular cyclicity, molecular shape, and chirality using graph theoretical invariants.
a graph is called textit{circulant} if it is a cayley graph on a cyclic group, i.e. its adjacency matrix is circulant. let $d$ be a set of positive, proper divisors of the integer $n>1$. the integral circulant graph $icg_{n}(d)$ has the vertex set $mathbb{z}_{n}$ and the edge set e$(icg_{n}(d))= {{a,b}; gcd(a-b,n)in d }$. let $n=p_{1}p_{2}cdots p_{k}m$, where $p_{1},p_{2},cdots,p_{k}$ are disti...
0
in this paper we study the coprime graph of a group $g$. the coprime graph of a group $g$, is a graph whose vertices are elements of $g$ and two distinct vertices $x$ and $y$ are adjacent iff $(|x|,|y|)=1$. in this paper we classify all the groups which the coprime graph is a complete r-partite graph or a planar graph. also we study the automorphism group of the coprime graph.
Let G be a simple connected molecular graph with vertex set V(G) and edge set E(G). One important modification of classical Zagreb index, called hyper Zagreb index HM(G) is defined as the sum of squares of the degree sum of the adjacent vertices, that is, sum of the terms 2 [ ( ) ( )] G G d u d v over all the edges of G, where ( ) G d u denote the degree of the vetex u of G. In this paper, th...
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
the energy of a graph is equal to the sum of the absolute values of its eigenvalues. two graphs of the same order are said to be equienergetic if their energies are equal. we point out the following two open problems for equienergetic graphs. (1) although it is known that there are numerous pairs of equienergetic, non-cospectral trees, it is not known how to systematically construct any such pa...
Molecular descriptors are essential in mathematical chemistry for studying quantitative structure–property relationships (QSPRs), and topological indices a valuable source of information about molecular properties, such as size, cyclicity, branching degree, symmetry. Graph theory has played crucial role the development dominating parameters descriptors. A molecule graph, under graph isomorphism...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید