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.
160 related articles for article (PubMed ID: 34712860)
1. 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]
2. 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]
3. 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]
4. Randić energy of digraphs. Cruz R; Monsalve J; Rada J Heliyon; 2022 Nov; 8(11):e11874. PubMed ID: 36458296 [TBL] [Abstract][Full Text] [Related]
5. 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]
6. 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]
7. 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]
8. L(2,1)-labeling of the strong product of paths and cycles. Shao Z; Vesel A ScientificWorldJournal; 2014; 2014():741932. PubMed ID: 24711734 [TBL] [Abstract][Full Text] [Related]
9. 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]
10. 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]
11. 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]
12. 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]
13. Further results on the radio number for some construction of the path, complete, and complete bipartite graphs. Mari B; Jeyaraj RS Heliyon; 2024 Jul; 10(14):e34434. PubMed ID: 39130467 [TBL] [Abstract][Full Text] [Related]
14. Dataset of Edmonds' bi-vectors and tri-vectors with realizations. Boros E; Gurvich V; Krnc M; Milanič M; Vičič J Data Brief; 2024 Oct; 56():110785. PubMed ID: 39224508 [TBL] [Abstract][Full Text] [Related]
15. 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]
17. 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]
18. 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]