Showing 241 - 260 results of 1,874 for search '((spie OR ((spine OR sspine) OR fine)) OR ((peng OR (xiong OR hingga)) OR pin))', query time: 0.20s Refine Results
  1. 241
  2. 242

    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
  3. 243
  4. 244

    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
    “…We show, by way of a correspondence analysis between the two sets of clusters, that they correspond to coarse-grained and fine-grained structure of the network relationships. …”
    Get full text
    Get full text
    Journal Article
  5. 245
  6. 246
  7. 247
  8. 248
  9. 249
  10. 250
  11. 251
  12. 252
  13. 253
  14. 254
  15. 255
  16. 256
  17. 257
  18. 258
  19. 259
  20. 260