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 *

151 related articles for article (PubMed ID: 33927452)

  • 1. NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH.
    Linderman GC; Steinerberger S
    Math Comput; 2020; 89(324):1933-1952. PubMed ID: 33927452
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Local Multiset Dimension of Amalgamation Graphs.
    Alfarisi R; Susilowati L; Dafik D; Prabhu S
    F1000Res; 2023; 12():95. PubMed ID: 38835804
    [No Abstract]   [Full Text] [Related]  

  • 3. On the spectrum, energy and Laplacian energy of graphs with self-loops.
    Preetha P U; Suresh M; Bonyah E
    Heliyon; 2023 Jul; 9(7):e17001. PubMed ID: 37415950
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A note on heat kernel of graphs.
    Yang Y; Ke W; Wang Z; Qiao H
    Heliyon; 2024 Jun; 10(12):e32235. PubMed ID: 39183868
    [TBL] [Abstract][Full Text] [Related]  

  • 5. On the antimagicness of generalized edge corona graphs.
    D N; S DY
    Heliyon; 2024 Jan; 10(2):e24002. PubMed ID: 38293383
    [TBL] [Abstract][Full Text] [Related]  

  • 6. 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]  

  • 7. The differential on operator S(Γ).
    Castro J; Basilio LA; Reyna G; Rosario O
    Math Biosci Eng; 2023 May; 20(7):11568-11584. PubMed ID: 37501409
    [TBL] [Abstract][Full Text] [Related]  

  • 8. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

  • 9. The partition dimension of the vertex amalgamation of some cycles.
    Hasmawati ; Hinding N; Nurwahyu B; Syukur Daming A; Kamal Amir A
    Heliyon; 2022 Jun; 8(6):e09596. PubMed ID: 35711982
    [TBL] [Abstract][Full Text] [Related]  

  • 10. The Connected
    Bai C; Zhou J; Liang Z
    Comput Intell Neurosci; 2021; 2021():3533623. PubMed ID: 34992643
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Relations between ordinary energy and energy of a self-loop graph.
    Rakshith BR; Das KC; Manjunatha BJ; Shang Y
    Heliyon; 2024 Mar; 10(6):e27756. PubMed ID: 38509879
    [TBL] [Abstract][Full Text] [Related]  

  • 12. On
    Inayah N; Susanto F; Semaničová-Feňovčíková A
    Heliyon; 2021 Oct; 7(10):e08203. PubMed ID: 34712860
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO
    Day MC; Hawthorne FC
    Acta Crystallogr A Found Adv; 2022 May; 78(Pt 3):212-233. PubMed ID: 35502713
    [TBL] [Abstract][Full Text] [Related]  

  • 14. The Complexity of Optimal Design of Temporally Connected Graphs.
    Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG
    Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Seeing the results of a mutation with a vertex weighted hierarchical graph.
    Knisley DJ; Knisley JR
    BMC Proc; 2014; 8(Suppl 2 Proceedings of the 3rd Annual Symposium on Biologica):S7. PubMed ID: 25237394
    [TBL] [Abstract][Full Text] [Related]  

  • 16. The dominant metric dimension of graphs.
    Susilowati L; Sa'adah I; Fauziyyah RZ; Erfanian A; Slamin
    Heliyon; 2020 Mar; 6(3):e03633. PubMed ID: 32226834
    [TBL] [Abstract][Full Text] [Related]  

  • 17. 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]  

  • 18. The reflexive edge strength on some almost regular graphs.
    Agustin IH; Dafik ; Imam Utoyo M; Slamin ; Venkatachalam M
    Heliyon; 2021 May; 7(5):e06991. PubMed ID: 34027187
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A Simple Algorithm for Finding All k-Edge-Connected Components.
    Wang T; Zhang Y; Chin FY; Ting HF; Tsin YH; Poon SH
    PLoS One; 2015; 10(9):e0136264. PubMed ID: 26368134
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.