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 *

150 related articles for article (PubMed ID: 36313815)

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

  • 2. On the spectral radius and energy of signless Laplacian matrix of digraphs.
    Ganie HA; Shang Y
    Heliyon; 2022 Mar; 8(3):e09186. PubMed ID: 35368532
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 6. On Hamiltonian Decomposition Problem of 3-Arc Graphs.
    Xu G; Sun Q; Liang Z
    Comput Intell Neurosci; 2022; 2022():5837405. PubMed ID: 35528366
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Bounds of the spectral radius and the Nordhaus-Gaddum type of the graphs.
    Wang T; Jia L; Sun F
    ScientificWorldJournal; 2013; 2013():472956. PubMed ID: 23844399
    [TBL] [Abstract][Full Text] [Related]  

  • 8. On the signless laplacian spectral radius of bicyclic graphs with perfect matchings.
    Zhang JM; Huang TZ; Guo JM
    ScientificWorldJournal; 2014; 2014():374501. PubMed ID: 25013853
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. Spectral properties of a class of unicyclic graphs.
    Du Z
    J Inequal Appl; 2017; 2017(1):96. PubMed ID: 28529433
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. A spectral graph convolution for signed directed graphs via magnetic Laplacian.
    Ko T; Choi Y; Kim CK
    Neural Netw; 2023 Jul; 164():562-574. PubMed ID: 37216757
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Local total anti-magic chromatic number of graphs.
    Sandhiya V; Nalliah M
    Heliyon; 2023 Jul; 9(7):e17761. PubMed ID: 37456059
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 17. On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree.
    Guo SG; Zhang R
    J Inequal Appl; 2017; 2017(1):120. PubMed ID: 28603399
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 20. An algorithmic characterization and spectral analysis of canonical splitting signed graph ξ(Σ).
    Sinha D; Kumar S
    MethodsX; 2024 Jun; 12():102517. PubMed ID: 38192360
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.