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.
345 related articles for article (PubMed ID: 27126114)
21. Minimal edge-transitive nets for the design and construction of metal-organic frameworks. Chen Z; Jiang H; O'Keeffe M; Eddaoudi M Faraday Discuss; 2017 Sep; 201():127-143. PubMed ID: 28660983 [TBL] [Abstract][Full Text] [Related]
22. 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]
23. On Divided-Type Connectivity of Graphs. Zhou Q; Wang X; Yao B Entropy (Basel); 2023 Jan; 25(1):. PubMed ID: 36673317 [TBL] [Abstract][Full Text] [Related]
24. 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]
25. Isogonal non-crystallographic periodic graphs based on knotted sodalite cages. Delgado-Friedrichs O; O'Keeffe M; Treacy MMJ Acta Crystallogr A Found Adv; 2020 Nov; 76(Pt 6):735-738. PubMed ID: 33125356 [TBL] [Abstract][Full Text] [Related]
26. Dynamic Graph Stream Algorithms in Huang Z; Peng P Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194 [TBL] [Abstract][Full Text] [Related]
27. Topological relations between three-dimensional periodic nets. I. Uninodal nets. Blatov VA Acta Crystallogr A; 2007 Jul; 63(Pt 4):329-43. PubMed ID: 17570895 [TBL] [Abstract][Full Text] [Related]
28. Finding the Optimal Nets for Self-Folding Kirigami. Araújo NAM; da Costa RA; Dorogovtsev SN; Mendes JFF Phys Rev Lett; 2018 May; 120(18):188001. PubMed ID: 29775357 [TBL] [Abstract][Full Text] [Related]
29. Cyclic connectivity index of fuzzy incidence graphs with applications in the highway system of different cities to minimize road accidents and in a network of different computers. Nazeer I; Rashid T; Hussain MT PLoS One; 2021; 16(9):e0257642. PubMed ID: 34547043 [TBL] [Abstract][Full Text] [Related]
34. Clustering algorithm with strength of connectedness for m-polar fuzzy network models. Akram M; Siddique S; Alharbi MG Math Biosci Eng; 2022 Jan; 19(1):420-455. PubMed ID: 34902998 [TBL] [Abstract][Full Text] [Related]
35. 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]
36. The Connected Bai C; Zhou J; Liang Z Comput Intell Neurosci; 2021; 2021():3533623. PubMed ID: 34992643 [TBL] [Abstract][Full Text] [Related]
37. Enumeration of four-connected three-dimensional nets. III. Conversion of edges of three-connected two-dimensional nets into saw chains. Han S; Smith JV Acta Crystallogr A; 1999 Mar; 55(Pt 2 Pt 2):360-382. PubMed ID: 10927266 [TBL] [Abstract][Full Text] [Related]
38. Non-crystallographic nets with freely acting, non-abelian local automorphism groups. de Oliveira MM; Eon JG Acta Crystallogr A; 2011 May; 67(Pt 3):240-51. PubMed ID: 21487182 [TBL] [Abstract][Full Text] [Related]
39. Surface embeddings of the Klein and the Möbius-Kantor graphs. Pedersen MC; Delgado-Friedrichs O; Hyde ST Acta Crystallogr A Found Adv; 2018 May; 74(Pt 3):223-232. PubMed ID: 29724968 [TBL] [Abstract][Full Text] [Related]
40. Robustness of random graphs based on graph spectra. Wu J; Barahona M; Tan YJ; Deng HZ Chaos; 2012 Dec; 22(4):043101. PubMed ID: 23278036 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]