Multiplicative Versions of First Zagreb Index

نویسندگان

  • Mehdi Eliasi
  • Ali Iranmanesh
  • Ivan Gutman
چکیده

The first Zagreb index of a graph G, with vertex set V (G) and edge set E(G), is defined as M1(G) = ∑ u∈V (G) d(u) 2 where d(u) denotes the degree of the vertex v. An alternative expression for M1(G) is ∑ uv∈E(G)[d(u) + d(v)]. We consider a multiplicative version of M1 defined as Π∗1(G) = ∏ uv∈E(G)[d(u) + d(v)]. We prove that among all connected graphs with a given number of vertices, the path has minimal Π∗1. We also determine the trees with the second–minimal Π∗1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extermal trees with respect to some versions of Zagreb indices via majorization

The aim of this paper is using the majorization technique to identify the classes of trees with extermal (minimal or maximal) value of some topological indices, among all trees of order n ≥ 12

متن کامل

Computing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers

The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...

متن کامل

On trees and the multiplicative sum Zagreb index

For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...

متن کامل

The ratio and product of the multiplicative Zagreb‎ ‎indices

‎The first multiplicative Zagreb index $Pi_1(G)$ is equal to the‎ ‎product of squares of the degree of the vertices and the second‎ ‎multiplicative Zagreb index $Pi_2(G)$ is equal to the product of‎ ‎the products of the degree of pairs of adjacent vertices of the‎ ‎underlying molecular graphs $G$‎. ‎Also‎, ‎the multiplicative sum Zagreb index $Pi_3(G)$ is equal to the product of‎ ‎the sum...

متن کامل

Sharp Upper Bounds for Multiplicative Zagreb Indices

For a (molecular) graph, the multiplicative Zagreb indices ∏ 1-index and ∏ 2index are multiplicative versions of the ordinary Zagreb indices (M1-index and M2index). In this note we report several sharp upper bounds for ∏ 1-index in terms of graph parameters including the order, size, radius, Wiener index and eccentric distance sum, and upper bounds for ∏ 2-index in terms of graph parameters inc...

متن کامل

On multiplicative Zagreb indices of graphs

Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1  G and ( ) 2  G , under the name first and second multiplicative Zagreb index, respectively. These are define as     ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012