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.
128 related articles for article (PubMed ID: 36313814)
21. Randić energy of digraphs. Cruz R; Monsalve J; Rada J Heliyon; 2022 Nov; 8(11):e11874. PubMed ID: 36458296 [TBL] [Abstract][Full Text] [Related]
22. The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures. Gao W; Wang W Comput Math Methods Med; 2015; 2015():418106. PubMed ID: 26640513 [TBL] [Abstract][Full Text] [Related]
23. 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]
24. On the super edge-magic deficiency of some graphs. Krisnawati VH; Ngurah AAG; Hidayat N; Alghofari AR Heliyon; 2020 Nov; 6(11):e05561. PubMed ID: 33294698 [TBL] [Abstract][Full Text] [Related]
25. Metric basis and metric dimension of 1-pentagonal carbon nanocone networks. Hussain Z; Munir M; Ahmad A; Chaudhary M; Alam Khan J; Ahmed I Sci Rep; 2020 Nov; 10(1):19687. PubMed ID: 33184343 [TBL] [Abstract][Full Text] [Related]
26. On Metric Dimension in Some Hex Derived Networks. Shao Z; Wu P; Zhu E; Chen L Sensors (Basel); 2018 Dec; 19(1):. PubMed ID: 30597887 [TBL] [Abstract][Full Text] [Related]
27. 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]
29. 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]
30. Anti-Kekulé number of the {(3, 4), 4}-fullerene Yang R; Jia H Front Chem; 2023; 11():1132587. PubMed ID: 36909705 [TBL] [Abstract][Full Text] [Related]
34. 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]
35. All graphs of order Baskoro ET; Haryeni DO Heliyon; 2020 Apr; 6(4):e03694. PubMed ID: 32322708 [TBL] [Abstract][Full Text] [Related]
36. 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]
37. 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]
38. 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]
39. The extreme vertices of the power graph of a group. AbuGhneim OA; Abudayah M Heliyon; 2022 Dec; 8(12):e12443. PubMed ID: 36590476 [TBL] [Abstract][Full Text] [Related]
40. 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] [Previous] [Next] [New Search]