نتایج جستجو برای: Zagreb polynomial

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

A. ASTANEH-ASL GH. FATH-TABAR

Let G be a graph. The first Zagreb polynomial M1(G, x) and the third Zagreb polynomial M3(G, x) of the graph G are defined as:     ( ) ( , ) [ ] e uv E G G x x d(u) + d(v) M1 , ( , )  euvE(G) G x x|d(u) - d(v)| M3 . In this paper, we compute the first and third Zagreb polynomials of Cartesian product of two graphs and a type of dendrimers.

In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...

We show how generalized Zagreb indices $M_1^k(G)$ can be computed by using a simple graph polynomial and Stirling numbers of the second kind. In that way we explain and clarify the meaning of a triangle of numbers used to establish the same result in an earlier reference.

Journal: :iranian journal of mathematical chemistry 2015
s. klavžar e. deutsch

let $g$ be a graph and let $m_{ij}(g)$, $i,jge 1$, be the number of edges $uv$ of $g$ such that ${d_v(g), d_u(g)} = {i,j}$. the {em $m$-polynomial} of $g$ is introduced with $displaystyle{m(g;x,y) = sum_{ile j} m_{ij}(g)x^iy^j}$. it is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...

2016
Mehdi Alaeiyan Mohammad Reza Farahani Muhammad Kamran Jamil M. R. Rajesh Kanna

Let G = (V,E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges, e = uv∈E(G), d(u) is degree of vertex u. Then the first Zagreb polynomial and the first Zagreb index Zg1(G,x) and Zg1(G) of the graph G are defined as ( ) ( ) ∑ u v u d v E G d x + ∈ and ( ) ( ) ∑ e u G v uv E d d = ∈ + respectively. Recently Ghorbani and Hosseinzadeh introduced the first Eccentric Z...

2017
Muhammad Ajmal Waqas Nazeer Shin Min Kang

A chemical graph can be recognized by a numerical number (topological index), algebraic polynomial or any matrix. These numbers and polynomials help to predict many physico-chemical properties of underline chemical compound. In this paper, 1Corresponding author. we compute first and second Zagreb polynomials and multiple Zagreb indices of the Line graphs of Banana tree graph, Firecracker graph ...

Journal: :Symmetry 2021

We obtain inequalities involving many topological indices in classical graph products by using the f-polynomial. In particular, we work with lexicographic product, Cartesian sum and first Zagreb, forgotten, inverse degree lordeg indices.

Journal: :Symmetry 2023

A topological index, which is a number, connected to graph. It often used in chemometrics, biomedicine, and bioinformatics anticipate various physicochemical properties biological activities of compounds. The purpose this article encourage original research focused on graph indices for the drugs azacitidine, decitabine, guadecitabine as well an investigation genesis symmetry actual networks. Sy...

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

As an inorganic chemical, magnesium iodide has a significant crystalline structure. It is complex and multi-functional substance that the potential to be used in wide range of medical advancements. Molecular graph theory, on other hand, provides sufficient cost-effective method investigating chemical structures networks. M-polynomial relatively new for studying networks molecular theory. displa...

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

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