Showing 141 - 160 results of 1,251 for search '((pick OR ((minglee OR mingle) OR spingg)) OR (((spans OR (peng OR sink)) OR ssspingea) OR pin))', query time: 0.17s Refine Results
  1. 141
  2. 142
  3. 143
  4. 144
  5. 145
  6. 146
  7. 147

    On the edge‐toughness of a graph. II by Peng, Y.H., Tay, T.S.

    Published 1993
    “…We also give a simpler proof to the following result of Peng et al.: For any positive integers r, s satisfying r/2 < s ≤ r, there exists an infinite family of graphs such that for each graph G in the family, λ(G) = r (where λ(G) is the edge‐connectivity of G) T1(G) = s, and G can be factored into s spanning trees.…”
    Article
  8. 148
  9. 149
  10. 150
  11. 151
  12. 152
  13. 153
  14. 154
  15. 155
  16. 156
  17. 157
  18. 158
  19. 159

    Health and disease phenotyping in old age using a cluster network analysis by Valenzuela, Jesus Felix, Monterola, Christopher, Tong, Victor Joo Chuan, Ng, Tze Pin, Larbi, Anis

    Published 2018
    “…The clusters obtained from the minimum spanning tree mapped to various conceptual domains and corresponded to physiological and syndromic states. …”
    Get full text
    Get full text
    Journal Article
  20. 160