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 *

126 related articles for article (PubMed ID: 24711734)

  • 1. L(2,1)-labeling of the strong product of paths and cycles.
    Shao Z; Vesel A
    ScientificWorldJournal; 2014; 2014():741932. PubMed ID: 24711734
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. On the Extremal Wiener Polarity Index of Hückel Graphs.
    Wang H
    Comput Math Methods Med; 2016; 2016():3873597. PubMed ID: 27247613
    [TBL] [Abstract][Full Text] [Related]  

  • 4. On the super edge-magic deficiency of some graphs.
    Krisnawati VH; Ngurah AAG; Hidayat N; Alghofari AR
    Heliyon; 2020 Nov; 6(11):e05561. PubMed ID: 33294698
    [TBL] [Abstract][Full Text] [Related]  

  • 5. On the Adjacent Eccentric Distance Sum Index of Graphs.
    Qu H; Cao S
    PLoS One; 2015; 10(6):e0129497. PubMed ID: 26091095
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Quest for molecular graphs with maximal energy: a computer experiment.
    Gutman I; Vidović D
    J Chem Inf Comput Sci; 2001; 41(4):1002-5. PubMed ID: 11500116
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Characterization of 2-Path Product Signed Graphs with Its Properties.
    Sinha D; Sharma D
    Comput Intell Neurosci; 2017; 2017():1235715. PubMed ID: 28761437
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 13. Entropy, Graph Homomorphisms, and Dissociation Sets.
    Wang Z; Tu J; Lang R
    Entropy (Basel); 2023 Jan; 25(1):. PubMed ID: 36673303
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Radio antipodal number of honeycomb derived networks.
    Gomathi S; Venugopal P
    Sci Rep; 2022 Nov; 12(1):18993. PubMed ID: 36347943
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Label-based routing for a family of small-world Farey graphs.
    Zhai Y; Wang Y
    Sci Rep; 2016 May; 6():25621. PubMed ID: 27167605
    [TBL] [Abstract][Full Text] [Related]  

  • 17. The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices.
    Zhang X; Jiang H; Liu JB; Shao Z
    Molecules; 2018 Jul; 23(7):. PubMed ID: 30012953
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. On the number of spanning trees of graphs.
    Bozkurt SB; Bozkurt D
    ScientificWorldJournal; 2014; 2014():294038. PubMed ID: 24688378
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
    Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.