نتایج جستجو برای: molecular graph with tree structure multiplicative zagreb indices

تعداد نتایج: 10050897  

Journal: :Symmetry 2021

A connected graph G is said to be a cactus if any two cycles have at most one vertex in common. The multiplicative sum Zagreb index of the product degrees adjacent vertices G. In this paper, we introduce several transformations that are useful tools for study extremal properties index. Using these and symmetric structural representations some graphs, determine graphs having maximal with prescri...

Journal: :Cmes-computer Modeling in Engineering & Sciences 2023

Topological indices (TIs) have been practiced for distinct wide-ranging physicochemical applications, especially used to characterize and model the chemical structures of various molecular compounds such as dendrimers, nanotubes neural networks with respect their certain properties solubility, stability low cytotoxicity. Dendrimers are prolonged artificially synthesized or amalgamated natural m...

Journal: :CoRR 2016
Nilanjan De

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph which was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced. In this paper we study the F-index of four operations on graphs which were introduced by Eliasi and Taeri [M. Eliasi, B. Taeri, Four new sums of graphs and their Wiener indices, Discrete Appl. Math.157...

Journal: :Discrete Applied Mathematics 2009
M. H. Khalifeh Hassan Yousefi-Azari Ali Reza Ashrafi

Journal: :Computers, materials & continua 2022

In this article, we calculate various topological invariants such as symmetric division degree index, redefined Zagreb VL first and second exponential multiplicative indices, entropy, entropies, entropy. We take the chemical compound named Proanthocyanidins, which is a very useful polyphenol in human’s diet. They are beneficial for one’s health. These compounds extracted from grape seeds. treme...

Let $G=(V,E)$, $V={v_1,v_2,ldots,v_n}$, be a simple graph with$n$ vertices, $m$ edges and a sequence of vertex degrees$Delta=d_1ge d_2ge cdots ge d_n=delta$, $d_i=d(v_i)$. Ifvertices $v_i$ and $v_j$ are adjacent in $G$, it is denoted as $isim j$, otherwise, we write $insim j$. The first Zagreb index isvertex-degree-based graph invariant defined as$M_1(G)=sum_{i=1}^nd_i^2$, whereas the first Zag...

2015
Yun Gao Zhiyang Jia Wei Gao

In past years, topological indices are introduced to measure the characters of chemical molecules. Thus, the study of these topological indices has raised large attention in the field of chemical science, biology science and pharmaceutical science. In this paper, by virtue of molecular structure analysis, we determine the total Szeged index, vertex-edge Wiener index and edge hyper-Wiener index ...

2012
Tomáš Madaras Martina Mockovčiaková Mariusz Meszka

In this note, we derive the lower bound on the sum for Wiener index of bipartite graph and its bipartite complement, as well as the lower and upper bounds on this sum for the Randić index and Zagreb indices. We also discuss the quality of these bounds.

Journal: :transactions on combinatorics 2016
nader habibi tayebeh dehghan zadeh ali reza ashrafi

the first zagreb index, $m_1(g)$, and second zagreb index, $m_2(g)$, of the graph $g$ is defined as $m_{1}(g)=sum_{vin v(g)}d^{2}(v)$ and $m_{2}(g)=sum_{e=uvin e(g)}d(u)d(v),$ where $d(u)$ denotes the degree of vertex $u$. in this paper, the firstand second maximum values of the first and second zagreb indicesin the class of all $n-$vertex tetracyclic graphs are presented.

Journal: :CoRR 2017
Nilanjan De

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

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید