These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

115 related articles for article (PubMed ID: 37420372)

  • 21. Rates of convergence for regression with the graph poly-Laplacian.
    Trillos NG; Murray R; Thorpe M
    Sampl Theory Signal Process Data Anal; 2023; 21(2):35. PubMed ID: 38037599
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Are randomly grown graphs really random?
    Callaway DS; Hopcroft JE; Kleinberg JM; Newman ME; Strogatz SH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Oct; 64(4 Pt 1):041902. PubMed ID: 11690047
    [TBL] [Abstract][Full Text] [Related]  

  • 23. On the Laplacian spectral radii of Halin graphs.
    Jia H; Xue J
    J Inequal Appl; 2017; 2017(1):73. PubMed ID: 28458483
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Comparison of Different Generalizations of Clustering Coefficient and Local Efficiency for Weighted Undirected Graphs.
    Wang Y; Ghumare E; Vandenberghe R; Dupont P
    Neural Comput; 2017 Feb; 29(2):313-331. PubMed ID: 27870616
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Delocalization-localization dynamical phase transition of random walks on graphs.
    Carugno G; Vivo P; Coghi F
    Phys Rev E; 2023 Feb; 107(2-1):024126. PubMed ID: 36932599
    [TBL] [Abstract][Full Text] [Related]  

  • 26. MagNet: A Neural Network for Directed Graphs.
    Zhang X; He Y; Brugnone N; Perlmutter M; Hirn M
    Adv Neural Inf Process Syst; 2021 Dec; 34():27003-27015. PubMed ID: 36046111
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Some sufficient conditions on hamilton graphs with toughness.
    Cai G; Yu T; Xu H; Yu G
    Front Comput Neurosci; 2022; 16():1019039. PubMed ID: 36313815
    [TBL] [Abstract][Full Text] [Related]  

  • 28. On transitivity and connectedness of Cayley graphs of gyrogroups.
    Maungchang R; Khachorncharoenkul P; Prathom K; Suksumran T
    Heliyon; 2021 May; 7(5):e07049. PubMed ID: 34036204
    [TBL] [Abstract][Full Text] [Related]  

  • 29. An exact algorithm to find a maximum weight clique in a weighted undirected graph.
    Rozman K; Ghysels A; Janežič D; Konc J
    Sci Rep; 2024 Apr; 14(1):9118. PubMed ID: 38643335
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Connectivity of Triangulation Flip Graphs in the Plane.
    Wagner U; Welzl E
    Discrete Comput Geom; 2022; 68(4):1227-1284. PubMed ID: 36466128
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Approximate von Neumann entropy for directed graphs.
    Ye C; Wilson RC; Comin CH; Costa Lda F; Hancock ER
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 May; 89(5):052804. PubMed ID: 25353841
    [TBL] [Abstract][Full Text] [Related]  

  • 32. On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian.
    Stone EA; Griffing AR
    Linear Algebra Appl; 2009 Oct; 431(10):1869-1880. PubMed ID: 23472045
    [TBL] [Abstract][Full Text] [Related]  

  • 33. A New Decomposition of the Graph Laplacian and the Binomial Structure of Mass-Action Systems.
    Müller S
    J Nonlinear Sci; 2023; 33(5):91. PubMed ID: 37546229
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Random-Walk Laplacian for Frequency Analysis in Periodic Graphs.
    Boukrab R; Pagès-Zamora A
    Sensors (Basel); 2021 Feb; 21(4):. PubMed ID: 33670095
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Prime labeling of graphs constructed from wheel graph.
    Abughazaleh B; Abughneim OA
    Heliyon; 2024 Jan; 10(2):e23979. PubMed ID: 38293456
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Average Consensus over Mobile Wireless Sensor Networks: Weight Matrix Guaranteeing Convergence without Reconfiguration of Edge Weights.
    Kenyeres M; Kenyeres J
    Sensors (Basel); 2020 Jun; 20(13):. PubMed ID: 32630083
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph.
    Jia H; Song H
    J Inequal Appl; 2018; 2018(1):69. PubMed ID: 29628745
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Graph Indices for Cartesian Product of -sum of Connected Graphs.
    Liu JB; Imran M; Baby S; Siddiqui HMA; Shafiq MK
    Comb Chem High Throughput Screen; 2022; 25(3):528-535. PubMed ID: 33596795
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Pseudoinverse of the Laplacian and best spreader node in a network.
    Van Mieghem P; Devriendt K; Cetinay H
    Phys Rev E; 2017 Sep; 96(3-1):032311. PubMed ID: 29346956
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Brain graph super-resolution for boosting neurological disorder diagnosis using unsupervised multi-topology connectional brain template learning.
    Mhiri I; Khalifa AB; Mahjoub MA; Rekik I
    Med Image Anal; 2020 Oct; 65():101768. PubMed ID: 32679534
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 6.