Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i  v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih  v  v  v  over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher R...

Here we consider the problem of providing near optimal performance for a large set of possible models. We adopt the H∞ framework in the single-input single-output (SISO) setting with structured uncertainty: a compact set of controllable and observable plant models of a fixed order; we consider the control problem of designing a controller to minimize the worst case performance. We consider two ...