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 *

122 related articles for article (PubMed ID: 11410054)

  • 1. On walks in molecular graphs.
    Gutman I; Rücker C; Rücker G
    J Chem Inf Comput Sci; 2001; 41(3):739-45. PubMed ID: 11410054
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Atomic walk counts of negative order.
    Lukovits I; Trinajstić N
    J Chem Inf Comput Sci; 2003; 43(4):1110-4. PubMed ID: 12870900
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Quantum Interference, Graphs, Walks, and Polynomials.
    Tsuji Y; Estrada E; Movassagh R; Hoffmann R
    Chem Rev; 2018 May; 118(10):4887-4911. PubMed ID: 29630345
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Mean first-passage time for random walks in general graphs with a deep trap.
    Lin Y; Julaiti A; Zhang Z
    J Chem Phys; 2012 Sep; 137(12):124104. PubMed ID: 23020321
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Finding structural anomalies in star graphs using quantum walks.
    Cottrell S; Hillery M
    Phys Rev Lett; 2014 Jan; 112(3):030501. PubMed ID: 24484125
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Walk counts, labyrinthicity, and complexity of acyclic and cyclic graphs and molecules.
    Rucker G; Rucker C
    J Chem Inf Comput Sci; 2000 Jan; 40(1):99-106. PubMed ID: 10661555
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor.
    Qiang X; Wang Y; Xue S; Ge R; Chen L; Liu Y; Huang A; Fu X; Xu P; Yi T; Xu F; Deng M; Wang JB; Meinecke JDA; Matthews JCF; Cai X; Yang X; Wu J
    Sci Adv; 2021 Feb; 7(9):. PubMed ID: 33637521
    [TBL] [Abstract][Full Text] [Related]  

  • 9. On sum-connectivity matrix and sum-connectivity energy of (molecular) graphs.
    Zhou B; Trinajstić N
    Acta Chim Slov; 2010 Sep; 57(3):518-23. PubMed ID: 24061795
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Maximal-entropy random walk unifies centrality measures.
    Ochab JK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Dec; 86(6 Pt 2):066109. PubMed ID: 23368006
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Infinite Ergodic Walks in Finite Connected Undirected Graphs.
    Volchenkov D
    Entropy (Basel); 2021 Feb; 23(2):. PubMed ID: 33567624
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Bond-based global and local (bond, group and bond-type) quadratic indices and their applications to computer-aided molecular design. 1. QSPR studies of diverse sets of organic chemicals.
    Marrero-Ponce Y; Torrens F; Alvarado YJ; Rotondo R
    J Comput Aided Mol Des; 2006; 20(10-11):685-701. PubMed ID: 17186417
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings.
    Godsil C; Roberson DE; Rooney B; Šámal R; Varvitsiotis A
    Discrete Comput Geom; 2017; 58(2):265-292. PubMed ID: 32025074
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Spectral clustering with epidemic diffusion.
    Smith LM; Lerman K; Garcia-Cardona C; Percus AG; Ghosh R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Oct; 88(4):042813. PubMed ID: 24229231
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Random walks in weighted networks with a perfect trap: an application of Laplacian spectra.
    Lin Y; Zhang Z
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jun; 87(6):062140. PubMed ID: 23848660
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Transport Efficiency of Continuous-Time Quantum Walks on Graphs.
    Razzoli L; Paris MGA; Bordone P
    Entropy (Basel); 2021 Jan; 23(1):. PubMed ID: 33435338
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneities.
    Mitrović M; Tadić B
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Aug; 80(2 Pt 2):026123. PubMed ID: 19792216
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Experimental Parity-Time Symmetric Quantum Walks for Centrality Ranking on Directed Graphs.
    Wu T; Izaac JA; Li ZX; Wang K; Chen ZZ; Zhu S; Wang JB; Ma XS
    Phys Rev Lett; 2020 Dec; 125(24):240501. PubMed ID: 33412067
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.