Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A- SCIENCE   SUMMER 2014 , Volume 38 , Number A3; Page(s) 213 To 219.
 
Paper: 

ON THE FIRST EXTENDED ZEROTH-ORDER CONNECTIVITY INDEX OF TREES

 
 
Author(s):  WANG S., ZHOU B.*
 
* DEPARTMENT OF MATHEMATICS, SOUTH CHINA NORMAL UNIVERSITY, GUANGZHOU 510631, P. R. CHINA
 
Abstract: 

The first extended zeroth-order connectivity index of a graph G is defined as 0c1(G)=SvIV(G) D-1/2v where V(G) is the vertex set of G, and DV is the sum of degrees of neighbors of vertex v in G. We give a sharp lower bound for the first extended zeroth-order connectivity index of trees with given numbers of vertices and pendant vertices, and characterize the extremal trees. We also determine the n -vertex trees with the first three smallest first extended zeroth-order connectivity indices.

 
Keyword(s): ZEROTH-ORDER CONNECTIVITY INDEX, EXTENDED ZEROTH-ORDER CONNECTIVITY INDEX, TREES, PENDANT VERTICES, DEGREE OF VERTICES
 
References: 
  • ندارد
 
  pdf-File tarjomyar Yearly Visit 69
 
Latest on Blog
Enter SID Blog