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 *

109 related articles for article (PubMed ID: 36353170)

  • 1. Two types irregular labelling on dodecahedral modified generalization graph.
    Hinding N; Sugeng KA; Nurlindah ; Wahyudi TJ; Simanjuntak R
    Heliyon; 2022 Nov; 8(11):e11197. PubMed ID: 36353170
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes.
    Shabbir A; Nadeem MF; Ovais A; Ashraf F; Nasir S
    Comb Chem High Throughput Screen; 2022; 25(3):500-509. PubMed ID: 33297913
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

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

  • 10. Non-Weyl Microwave Graphs.
    Ławniczak M; Lipovský J; Sirko L
    Phys Rev Lett; 2019 Apr; 122(14):140503. PubMed ID: 31050459
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Genus Ranges of 4-Regular Rigid Vertex Graphs.
    Buck D; Dolzhenko E; Jonoska N; Saito M; Valencia K
    Electron J Comb; 2015; 22(3):. PubMed ID: 27807395
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Vertex Deletion into Bipartite Permutation Graphs.
    Bożyk Ł; Derbisz J; Krawczyk T; Novotná J; Okrasa K
    Algorithmica; 2022; 84(8):2271-2291. PubMed ID: 35880199
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Splitting Vertices in 2-Layer Graph Drawings.
    Ahmed R; Angelini P; Bekos MA; Battista GD; Kaufmann M; Kindermann P; Kobourov S; Nollenburg M; Symvonis A; Villedieu A; Wallinger M
    IEEE Comput Graph Appl; 2023; 43(3):24-35. PubMed ID: 37023163
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Relating Vertex and Global Graph Entropy in Randomly Generated Graphs.
    Tee P; Parisis G; Berthouze L; Wakeman I
    Entropy (Basel); 2018 Jun; 20(7):. PubMed ID: 33265571
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
    Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B
    Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Exactly solvable model of a coalescing random graph.
    Lushnikov AA
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Feb; 91(2):022119. PubMed ID: 25768470
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Computing the partition dimension of certain families of Toeplitz graph.
    Luo R; Khalil A; Ahmad A; Azeem M; Ibragimov G; Nadeem MF
    Front Comput Neurosci; 2022; 16():959105. PubMed ID: 36313814
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Common vertex matrix: a novel characterization of molecular graphs by counting.
    Randić M; Novič M; Plavšić D
    J Comput Chem; 2013 Jun; 34(16):1409-19. PubMed ID: 23619822
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Computing Analysis of Degree and Connection Based Irregular Indices of Polycyclic Aromatic Hydrocarbons.
    Javaid M; Ibraheem M; Raheem A
    Curr Org Synth; 2021; 18(8):742-749. PubMed ID: 33687896
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.