Showing 261 - 280 results of 2,185 for search '((pinnae OR fine) OR ((ping OR sying) OR (pin OR (peng OR siying))))', query time: 0.20s Refine Results
  1. 261
  2. 262

    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. 263
  4. 264
  5. 265
  6. 266
  7. 267
  8. 268
  9. 269
  10. 270
  11. 271
  12. 272
  13. 273
  14. 274
  15. 275
  16. 276
  17. 277

    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
  18. 278
  19. 279
  20. 280