computing the szeged index of 4,4 ׳-bipyridinium dendrimer
نویسندگان
چکیده
let e be an edge of a g connecting the vertices u and v. define two sets n1 (e | g) andn2(e |g) as n1(e | g)= {xv(g) d(x,u) d(x,v)} and n2(e | g)= {xv(g) d(x,v) d(x,u) }.thenumber of elements of n1(e | g) and n2(e | g) are denoted by n1(e | g) and n2(e | g) ,respectively. the szeged index of the graph g is defined as sz(g) ( ) ( ) 1 2 n e g n e g e e . inthis paper we compute the szeged index of a 4,4 ׳-bipyridinium dendrimer.
منابع مشابه
Computing the Szeged index of 4,4 ׳-bipyridinium dendrimer
Let e be an edge of a G connecting the vertices u and v. Define two sets N1 (e | G) and N2(e |G) as N1(e | G)= {xV(G) d(x,u) d(x,v)} and N2(e | G)= {xV(G) d(x,v) d(x,u) }.The number of elements of N1(e | G) and N2(e | G) are denoted by n1(e | G) and n2(e | G) , respectively. The Szeged index of the graph G is defined as Sz(G) ( ) ( ) 1 2 n e G n e G e E . In this paper we compute th...
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملPI, Szeged and Edge Szeged Polynomials of a Dendrimer Nanostar
Let G be a graph with vertex and edge sets V(G) and E(G), respectively. As usual, the distance between the vertices u and v of a connected graph G is denoted by d(u,v) and it is defined as the number of edges in a minimal path connecting the vertices u and v. Throughout the paper, a graph means undirected connected graph without loops and multiple edges. In chemical graph theory, a molecular gr...
متن کاملcomputing szeged index of graphs on triples
abstract let g=(v,e) be a simple connected graph with vertex set v and edge set e. the szeged index of g is defined by where respectively is the number of vertices of g closer to u (respectively v) than v (respectively u). if s is a set of size let v be the set of all subsets of s of size 3. then we define three ...
متن کاملThe Wiener, Szeged, and PI Indices of a Dendrimer Nanosta
Let G= V E be a simple connected graph. The distance between two vertices of G is defined to be the length of the shortest path between the two vertices. There are topological indices assigned to G and based on the distance function which are invariant under the action of the automorphism group of G. Some important indices assigned to G are the Wiener, Szeged, and PI index which we will find th...
متن کاملThe Wiener, Szeged and Pi-indices of a Phenylazomethine Dendrimer
Let G be a simple graph with vertex set and edge set . The function which assigns to each pair of vertices in , the length of minimal path from to , is called the distance function between two vertices. The distance function between and edge and a vertex is where for and. , . The Wiener index of a graph is denoted by and is defined by .In general this kind of index is called a topological index...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
iranian journal of mathematical chemistryناشر: university of kashan
ISSN 2228-6489
دوره 3
شماره 1 2012
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023