نتایج جستجو برای: Vertex-degree-based indices

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

I. GUTMAN

A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...

Journal: :iranian journal of mathematical chemistry 2012
m. ghorbani n. azimi

the zagreb indices are the oldest graph invariants used in mathematical chemistry to predictthe chemical phenomena. in this paper we define the multiple versions of zagreb indicesbased on degrees of vertices in a given graph and then we compute the first and secondextremal graphs for them.

Journal: :iranian journal of mathematical chemistry 2012
i. gutman

a recently published paper [t. došlić, this journal 3 (2012) 25-34] considers the zagrebindices of benzenoid systems, and points out their low discriminativity. we show thatanalogous results hold for a variety of vertex-degree-based molecular structure descriptorsthat are being studied in contemporary mathematical chemistry. we also show that theseresults are straightforwardly obtained by using...

Journal: :Acta Chimica Slovenica 2016

M. GHORBANI N. AZIMI

The Zagreb indices are the oldest graph invariants used in mathematical chemistry to predict the chemical phenomena. In this paper we define the multiple versions of Zagreb indices based on degrees of vertices in a given graph and then we compute the first and second extremal graphs for them.

2014
Roberto Cruz Iván Gutman Juan Rada Ivan Gutman

We find the extremal values of the energy, the Wiener index and several vertex-degree-based topological indices over the set of Kragujevac trees with the central vertex of fixed degree. 2010 Mathematics Subject Classification : 05C90, 05C35.

In the extension of irregularity indices, Abdo et. al. [1] defined the total irregu-larity of a graph G = (V, E) as irrt(G) = 21 Pu,v∈V (G) du − dv, where du denotesthe vertex degree of a vertex u ∈ V (G). In this paper, we investigate the totalirregularity of trees with bounded maximal degree Δ and state integer linear pro-gramming problem which gives standard information about extremal trees a...

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

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