in this paper we give sharp upper bounds on the zagreb indices and characterize all trees achieving equality in these bounds. also, we give lower bound on first zagreb coindex of trees.

Let $G=(V,E)$, $V={v_1,v_2,ldots,v_n}$, be a simple graph with$n$ vertices, $m$ edges and a sequence of vertex degrees$Delta=d_1ge d_2ge cdots ge d_n=delta$, $d_i=d(v_i)$. Ifvertices $v_i$ and $v_j$ are adjacent in $G$, it is denoted as $isim j$, otherwise, we write $insim j$. The first Zagreb index isvertex-degree-based graph invariant defined as$M_1(G)=sum_{i=1}^nd_i^2$, whereas the first Zag...

  Dislocation of the first carpometacarpal (CMC) is a rare occurrence. Treatment of this dislocation varies from closed reduction and casting to ligament repair. Neglected dislocation or incomplete reduction of the 1st CMC cause chronic instability and painful arthritis, muscle imbalance and decreased grip force. In our study 6 patients is evaluated that were visited in less than 24 hours from ...

0

0

We present an algorithm that exploits the complimentary benefits of best-first search (BFS) and depth-first search (DFS) by performing limited DFS lookaheads from the frontier of BFS. We show that this continuum requires significantly less memory than BFS. In addition, a time speedup is also achieved when choosing the lookahead depth correctly. We demonstrate this idea for breadth-first search ...