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 *

127 related articles for article (PubMed ID: 35265766)

  • 1. Sombor index of directed graphs.
    Cruz R; Monsalve J; Rada J
    Heliyon; 2022 Mar; 8(3):e09035. PubMed ID: 35265766
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Revan Sombor indices: Analytical and statistical study.
    Kulli VR; Méndez-Bermúdez JA; Rodríguez JM; Sigarreta JM
    Math Biosci Eng; 2023 Jan; 20(2):1801-1819. PubMed ID: 36899509
    [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. 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]  

  • 5. On Some Topological Indices Defined via the Modified Sombor Matrix.
    Zuo X; Rather BA; Imran M; Ali A
    Molecules; 2022 Oct; 27(19):. PubMed ID: 36235303
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Digraph Energy of Directed Polygons.
    Deng B; Yang N; Liang W; Lu X
    Comb Chem High Throughput Screen; 2022; 25(3):496-499. PubMed ID: 33176639
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Three methods for calculation of the hyper-Wiener index of molecular graphs.
    Cash G; Klavzar S; Petkovsek M
    J Chem Inf Comput Sci; 2002; 42(3):571-6. PubMed ID: 12086516
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Degree sequence for
    Hong Y; Liu Q
    J Inequal Appl; 2017; 2017(1):266. PubMed ID: 29104404
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 13. Normalized Sombor Indices as Complexity Measures of Random Networks.
    Aguilar-Sánchez R; Méndez-Bermúdez JA; Rodríguez JM; Sigarreta JM
    Entropy (Basel); 2021 Jul; 23(8):. PubMed ID: 34441116
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Bounds for the general sum-connectivity index of composite graphs.
    Akhter S; Imran M; Raza Z
    J Inequal Appl; 2017; 2017(1):76. PubMed ID: 28469353
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Edge Mostar Indices of Cacti Graph With Fixed Cycles.
    Yasmeen F; Akhter S; Ali K; Rizvi STR
    Front Chem; 2021; 9():693885. PubMed ID: 34307297
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Comparing digraph and Petri net approaches to deadlock avoidance in FMS.
    Fanti MP; Maione B; Turchiano B
    IEEE Trans Syst Man Cybern B Cybern; 2000; 30(5):783-98. PubMed ID: 18252409
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Counter machines and crystallographic structures.
    Jonoska N; Krajcevski M; McColm G
    Nat Comput; 2016 Mar; 15(1):97-113. PubMed ID: 27616944
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 7.