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 *

113 related articles for article (PubMed ID: 38509879)

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

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

  • 3. Randić energy of digraphs.
    Cruz R; Monsalve J; Rada J
    Heliyon; 2022 Nov; 8(11):e11874. PubMed ID: 36458296
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 6. (p,q)-biclique counting and enumeration for large sparse bipartite graphs.
    Yang J; Peng Y; Ouyang D; Zhang W; Lin X; Zhao X
    VLDB J; 2023 Mar; ():1-25. PubMed ID: 37362202
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

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

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

  • 14. On Finding and Enumerating Maximal and Maximum
    Phillips CA; Wang K; Baker EJ; Bubier JA; Chesler EJ; Langston MA
    Algorithms; 2019 Jan; 12(1):. PubMed ID: 31448059
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. The local vertex anti-magic coloring for certain graph operations.
    Uma L; Rajasekaran G
    Heliyon; 2024 Jul; 10(13):e33400. PubMed ID: 39044974
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Computing The Energy of Certain Graphs based on Vertex Status.
    Khurshid A; Salman M
    Curr Org Synth; 2023 Aug; ():. PubMed ID: 37581326
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. On the nullity of a graph with cut-points.
    Gong SC; Xu GH
    Linear Algebra Appl; 2012 Jan; 436(1):135-142. PubMed ID: 22215910
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.