the first extended zeroth-order connectivity index of a graph   g is defined as 0 1/2 1 ( ) ( ) ,   v   v v g      g d      where   v   (g) is the vertex set of g, and v d 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,...

In a connected graph , the distance function between each pair of two vertices from set vertex is shortest them and degree denoted by number edges which are incident to The Schultz modified polynomials have defined as: respectively, where summations taken over all unordered pairs distinct in general forms shall be found indices edge – identification chain ring square graphs present work.

the edge versions of reverse wiener indices were introduced by mahmiani et al. veryrecently. in this paper, we find their relation with ordinary (vertex) wiener index in somegraphs. also, we compute them for trees and tuc4c8(s) naotubes.

A graph is maximal k-degenerate if each induced subgraph has a vertex of degree at most k and adding any new edge to the violates this condition. In paper, we provide sharp lower upper bounds on Wiener indices graphs order $$n \ge 1$$ . chordal every cycle in triangle k$$ are k-trees. For k-trees 2k+2$$ , characterize all extremal for bound.

Abstract We study symmetries of bases and spanning sets in finite element exterior calculus, using representation theory. want to know which vector-valued spaces have invariant under permutation vertex indices. The permutations indices correspond the symmetry group simplex. That is represented on simplicial by pullback action. determine a natural notion invariance sufficient conditions dimensio...

Topological indices (TI) (descriptors) of a molecular graph are very much useful to study various physiochemical properties. It is also used develop the quantitative structure-activity relationship (QSAR), structure-property (QSPR) corresponding chemical compound. Various techniques have been developed calculate TI graph. Recently technique calculating degree-based from M-polynomial has introdu...

let g be a simple graph with vertex set v(g) {v1,v2 ,...vn} . for every vertex i v , ( ) i  vrepresents the degree of vertex i v . the h-th order of randić index, h r is defined as the sumof terms1 2 11( ), ( )... ( ) i i ih  v  v  vover all paths of length h contained (as sub graphs) in g . inthis paper , some bounds for higher randić index and a method for computing the higherrandic ind...